/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 21:31:24,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 21:31:24,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 21:31:24,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 21:31:24,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 21:31:24,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 21:31:24,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 21:31:24,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 21:31:24,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 21:31:24,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 21:31:24,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 21:31:24,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 21:31:24,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 21:31:24,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 21:31:24,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 21:31:24,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 21:31:24,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 21:31:24,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 21:31:24,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 21:31:24,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 21:31:24,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 21:31:24,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 21:31:24,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 21:31:24,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 21:31:24,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 21:31:24,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 21:31:24,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 21:31:24,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 21:31:24,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 21:31:24,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 21:31:24,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 21:31:24,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 21:31:24,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 21:31:24,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 21:31:24,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 21:31:24,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 21:31:24,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 21:31:24,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 21:31:24,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 21:31:24,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 21:31:24,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 21:31:24,471 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 [2021-06-10 21:31:24,511 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 21:31:24,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 21:31:24,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 21:31:24,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 21:31:24,515 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 21:31:24,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 21:31:24,515 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 21:31:24,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 21:31:24,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 21:31:24,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 21:31:24,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 21:31:24,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 21:31:24,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 21:31:24,516 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 21:31:24,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 21:31:24,517 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 21:31:24,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 21:31:24,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 21:31:24,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 21:31:24,517 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:31:24,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 21:31:24,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 21:31:24,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 21:31:24,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 21:31:24,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 21:31:24,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 21:31:24,842 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 21:31:24,843 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 21:31:24,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2021-06-10 21:31:24,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b205a4a3/1ecbd669d06949f78e6d6b8ad353e150/FLAG6668ec6eb [2021-06-10 21:31:25,398 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 21:31:25,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2021-06-10 21:31:25,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b205a4a3/1ecbd669d06949f78e6d6b8ad353e150/FLAG6668ec6eb [2021-06-10 21:31:25,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b205a4a3/1ecbd669d06949f78e6d6b8ad353e150 [2021-06-10 21:31:25,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 21:31:25,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 21:31:25,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 21:31:25,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 21:31:25,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 21:31:25,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:31:25" (1/1) ... [2021-06-10 21:31:25,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283a0fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:25, skipping insertion in model container [2021-06-10 21:31:25,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:31:25" (1/1) ... [2021-06-10 21:31:25,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 21:31:25,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 21:31:25,928 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i[951,964] [2021-06-10 21:31:26,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:31:26,148 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 21:31:26,158 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i[951,964] [2021-06-10 21:31:26,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:31:26,254 INFO L208 MainTranslator]: Completed translation [2021-06-10 21:31:26,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26 WrapperNode [2021-06-10 21:31:26,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 21:31:26,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 21:31:26,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 21:31:26,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 21:31:26,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 21:31:26,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 21:31:26,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 21:31:26,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 21:31:26,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 21:31:26,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 21:31:26,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 21:31:26,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 21:31:26,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (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 [2021-06-10 21:31:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 21:31:26,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 21:31:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 21:31:26,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 21:31:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 21:31:26,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 21:31:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 21:31:26,476 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 21:31:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 21:31:26,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 21:31:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 21:31:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 21:31:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 21:31:26,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 21:31:26,479 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 21:31:28,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 21:31:28,177 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 21:31:28,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:31:28 BoogieIcfgContainer [2021-06-10 21:31:28,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 21:31:28,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 21:31:28,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 21:31:28,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 21:31:28,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 09:31:25" (1/3) ... [2021-06-10 21:31:28,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cecbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:31:28, skipping insertion in model container [2021-06-10 21:31:28,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26" (2/3) ... [2021-06-10 21:31:28,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cecbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:31:28, skipping insertion in model container [2021-06-10 21:31:28,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:31:28" (3/3) ... [2021-06-10 21:31:28,186 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2021-06-10 21:31:28,191 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 21:31:28,195 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 21:31:28,196 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 21:31:28,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,246 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 21:31:28,262 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 21:31:28,279 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 21:31:28,280 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 21:31:28,280 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 21:31:28,280 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 21:31:28,280 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 21:31:28,280 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 21:31:28,280 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 21:31:28,280 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 21:31:28,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-06-10 21:31:28,321 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-06-10 21:31:28,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:28,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-10 21:31:28,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-06-10 21:31:28,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,330 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 21:31:28,341 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,344 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,362 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-06-10 21:31:28,362 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:28,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-10 21:31:28,365 INFO L151 LiptonReduction]: Number of co-enabled transitions 1578 [2021-06-10 21:31:28,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:28,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:28,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:28,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,756 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 21:31:28,756 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:28,781 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:29,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:29,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:29,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:29,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:29,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:29,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,867 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 21:31:29,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,319 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:30,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:30,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:30,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,743 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 21:31:31,213 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-10 21:31:31,359 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-10 21:31:31,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 21:31:31,384 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,387 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-10 21:31:31,387 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,390 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,392 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-10 21:31:31,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,394 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-10 21:31:31,395 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-10 21:31:31,395 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,397 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,399 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-10 21:31:31,400 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-10 21:31:31,400 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,401 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,404 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-10 21:31:31,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:31,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:31,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:31,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:32,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,040 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 21:31:32,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:32,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:32,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:32,367 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.1 percent of original size [2021-06-10 21:31:32,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,377 INFO L147 QuantifierPusher]: treesize reduction 22, result has 4.3 percent of original size 1 [2021-06-10 21:31:32,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-10 21:31:32,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:32,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,383 INFO L142 QuantifierPusher]: treesize reduction 24, result has 78.4 percent of original size [2021-06-10 21:31:32,385 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-10 21:31:32,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,397 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-10 21:31:32,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 21:31:32,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 21:31:32,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 21:31:32,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,414 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-10 21:31:32,414 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-10 21:31:32,414 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,416 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,416 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-10 21:31:32,417 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,418 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,418 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-10 21:31:32,418 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,420 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,422 INFO L147 QuantifierPusher]: treesize reduction 141, result has 54.4 percent of original size 168 [2021-06-10 21:31:32,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,426 INFO L142 QuantifierPusher]: treesize reduction 141, result has 65.9 percent of original size [2021-06-10 21:31:32,427 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 3, 2, 1] term [2021-06-10 21:31:32,427 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,428 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,429 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 3, 2, 1] term [2021-06-10 21:31:32,429 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,431 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,431 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 3, 2, 1] term [2021-06-10 21:31:32,431 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,433 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,436 INFO L147 QuantifierPusher]: treesize reduction 513, result has 19.5 percent of original size 124 [2021-06-10 21:31:32,437 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-10 21:31:32,437 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,438 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,439 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-10 21:31:32,439 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,440 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,441 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-10 21:31:32,441 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:32,443 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,450 INFO L147 QuantifierPusher]: treesize reduction 1984, result has 7.2 percent of original size 153 [2021-06-10 21:31:32,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,592 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 21:31:32,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:32,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 21:31:32,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 21:31:32,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 21:31:32,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 21:31:32,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:32,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:32,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:33,323 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-10 21:31:33,478 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-10 21:31:33,744 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-10 21:31:33,868 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-10 21:31:33,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,889 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:33,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:33,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:33,902 INFO L163 LiptonReduction]: Checked pairs total: 4059 [2021-06-10 21:31:33,902 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-10 21:31:33,905 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5576 [2021-06-10 21:31:33,912 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-06-10 21:31:33,912 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:33,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:33,913 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:33,913 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash 952872646, now seen corresponding path program 1 times [2021-06-10 21:31:33,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:33,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673168664] [2021-06-10 21:31:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:34,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673168664] [2021-06-10 21:31:34,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:31:34,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568466151] [2021-06-10 21:31:34,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:31:34,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:31:34,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:31:34,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 182 [2021-06-10 21:31:34,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 182 [2021-06-10 21:31:34,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,128 INFO L129 PetriNetUnfolder]: 16/64 cut-off events. [2021-06-10 21:31:34,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:34,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 64 events. 16/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 232 event pairs, 2 based on Foata normal form. 12/73 useless extension candidates. Maximal degree in co-relation 99. Up to 27 conditions per place. [2021-06-10 21:31:34,130 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-06-10 21:31:34,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2021-06-10 21:31:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:31:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:31:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2021-06-10 21:31:34,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8498168498168498 [2021-06-10 21:31:34,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2021-06-10 21:31:34,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2021-06-10 21:31:34,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2021-06-10 21:31:34,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,158 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 464 transitions. [2021-06-10 21:31:34,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2021-06-10 21:31:34,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:34,161 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-06-10 21:31:34,163 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-06-10 21:31:34,163 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-10 21:31:34,164 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-10 21:31:34,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,164 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 21:31:34,164 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1592390053, now seen corresponding path program 1 times [2021-06-10 21:31:34,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345767554] [2021-06-10 21:31:34,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:34,261 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:34,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345767554] [2021-06-10 21:31:34,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 21:31:34,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628568127] [2021-06-10 21:31:34,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:31:34,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:31:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:31:34,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-10 21:31:34,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-10 21:31:34,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,342 INFO L129 PetriNetUnfolder]: 12/66 cut-off events. [2021-06-10 21:31:34,343 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:34,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 66 events. 12/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 217 event pairs, 3 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 101. Up to 20 conditions per place. [2021-06-10 21:31:34,344 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 4 selfloop transitions, 3 changer transitions 8/32 dead transitions. [2021-06-10 21:31:34,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 104 flow [2021-06-10 21:31:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 732 transitions. [2021-06-10 21:31:34,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8043956043956044 [2021-06-10 21:31:34,349 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 732 transitions. [2021-06-10 21:31:34,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 732 transitions. [2021-06-10 21:31:34,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 732 transitions. [2021-06-10 21:31:34,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,355 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 732 transitions. [2021-06-10 21:31:34,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 104 flow [2021-06-10 21:31:34,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:34,356 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2021-06-10 21:31:34,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2021-06-10 21:31:34,357 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2021-06-10 21:31:34,357 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2021-06-10 21:31:34,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,358 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,358 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 21:31:34,358 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1129374410, now seen corresponding path program 1 times [2021-06-10 21:31:34,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569227099] [2021-06-10 21:31:34,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:34,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,516 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:34,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569227099] [2021-06-10 21:31:34,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:31:34,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019795961] [2021-06-10 21:31:34,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:31:34,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:31:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:31:34,541 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 182 [2021-06-10 21:31:34,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 182 [2021-06-10 21:31:34,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,644 INFO L129 PetriNetUnfolder]: 87/192 cut-off events. [2021-06-10 21:31:34,644 INFO L130 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2021-06-10 21:31:34,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 192 events. 87/192 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 797 event pairs, 51 based on Foata normal form. 10/197 useless extension candidates. Maximal degree in co-relation 446. Up to 117 conditions per place. [2021-06-10 21:31:34,648 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 8 selfloop transitions, 3 changer transitions 7/34 dead transitions. [2021-06-10 21:31:34,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 135 flow [2021-06-10 21:31:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2021-06-10 21:31:34,654 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7362637362637363 [2021-06-10 21:31:34,654 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2021-06-10 21:31:34,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2021-06-10 21:31:34,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2021-06-10 21:31:34,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,659 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 670 transitions. [2021-06-10 21:31:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 135 flow [2021-06-10 21:31:34,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 130 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:34,666 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 99 flow [2021-06-10 21:31:34,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2021-06-10 21:31:34,667 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2021-06-10 21:31:34,667 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 99 flow [2021-06-10 21:31:34,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,668 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 21:31:34,668 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 17844465, now seen corresponding path program 1 times [2021-06-10 21:31:34,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314176694] [2021-06-10 21:31:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:34,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,822 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:34,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314176694] [2021-06-10 21:31:34,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:34,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228147118] [2021-06-10 21:31:34,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:34,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:34,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:34,840 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 182 [2021-06-10 21:31:34,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 182 [2021-06-10 21:31:34,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,982 INFO L129 PetriNetUnfolder]: 71/180 cut-off events. [2021-06-10 21:31:34,982 INFO L130 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2021-06-10 21:31:34,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 180 events. 71/180 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 799 event pairs, 44 based on Foata normal form. 13/183 useless extension candidates. Maximal degree in co-relation 471. Up to 99 conditions per place. [2021-06-10 21:31:34,990 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 9 selfloop transitions, 5 changer transitions 6/36 dead transitions. [2021-06-10 21:31:34,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 175 flow [2021-06-10 21:31:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:31:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:31:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2021-06-10 21:31:34,998 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7014652014652014 [2021-06-10 21:31:34,998 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2021-06-10 21:31:34,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2021-06-10 21:31:35,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2021-06-10 21:31:35,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,008 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,008 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 99 flow. Second operand 6 states and 766 transitions. [2021-06-10 21:31:35,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 175 flow [2021-06-10 21:31:35,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:35,010 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 129 flow [2021-06-10 21:31:35,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-06-10 21:31:35,011 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2021-06-10 21:31:35,011 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 129 flow [2021-06-10 21:31:35,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,011 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 21:31:35,012 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash 47248330, now seen corresponding path program 1 times [2021-06-10 21:31:35,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357156484] [2021-06-10 21:31:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:35,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:35,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:35,129 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:35,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:35,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357156484] [2021-06-10 21:31:35,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:35,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002620641] [2021-06-10 21:31:35,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:35,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:35,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-10 21:31:35,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-10 21:31:35,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,284 INFO L129 PetriNetUnfolder]: 64/152 cut-off events. [2021-06-10 21:31:35,284 INFO L130 PetriNetUnfolder]: For 362/362 co-relation queries the response was YES. [2021-06-10 21:31:35,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 152 events. 64/152 cut-off events. For 362/362 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 601 event pairs, 34 based on Foata normal form. 7/150 useless extension candidates. Maximal degree in co-relation 500. Up to 87 conditions per place. [2021-06-10 21:31:35,287 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 12 selfloop transitions, 6 changer transitions 6/40 dead transitions. [2021-06-10 21:31:35,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 237 flow [2021-06-10 21:31:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:31:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:31:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2021-06-10 21:31:35,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.716640502354788 [2021-06-10 21:31:35,290 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2021-06-10 21:31:35,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2021-06-10 21:31:35,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2021-06-10 21:31:35,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,296 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,296 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 129 flow. Second operand 7 states and 913 transitions. [2021-06-10 21:31:35,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 237 flow [2021-06-10 21:31:35,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 222 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:35,299 INFO L241 Difference]: Finished difference. Result has 48 places, 30 transitions, 151 flow [2021-06-10 21:31:35,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=151, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2021-06-10 21:31:35,300 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2021-06-10 21:31:35,300 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 151 flow [2021-06-10 21:31:35,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,300 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-10 21:31:35,301 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash -376830399, now seen corresponding path program 1 times [2021-06-10 21:31:35,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723832681] [2021-06-10 21:31:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:35,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,355 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:35,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:35,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723832681] [2021-06-10 21:31:35,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:31:35,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287964897] [2021-06-10 21:31:35,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:31:35,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:31:35,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:31:35,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-10 21:31:35,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-10 21:31:35,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,428 INFO L129 PetriNetUnfolder]: 27/117 cut-off events. [2021-06-10 21:31:35,429 INFO L130 PetriNetUnfolder]: For 699/715 co-relation queries the response was YES. [2021-06-10 21:31:35,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 117 events. 27/117 cut-off events. For 699/715 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 580 event pairs, 13 based on Foata normal form. 13/122 useless extension candidates. Maximal degree in co-relation 419. Up to 38 conditions per place. [2021-06-10 21:31:35,430 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 5 selfloop transitions, 3 changer transitions 2/33 dead transitions. [2021-06-10 21:31:35,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 33 transitions, 201 flow [2021-06-10 21:31:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2021-06-10 21:31:35,433 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7978021978021979 [2021-06-10 21:31:35,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2021-06-10 21:31:35,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2021-06-10 21:31:35,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2021-06-10 21:31:35,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,438 INFO L185 Difference]: Start difference. First operand has 48 places, 30 transitions, 151 flow. Second operand 5 states and 726 transitions. [2021-06-10 21:31:35,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 33 transitions, 201 flow [2021-06-10 21:31:35,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 181 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:35,441 INFO L241 Difference]: Finished difference. Result has 49 places, 30 transitions, 152 flow [2021-06-10 21:31:35,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2021-06-10 21:31:35,441 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2021-06-10 21:31:35,441 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 152 flow [2021-06-10 21:31:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,442 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,442 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-10 21:31:35,442 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1292679205, now seen corresponding path program 1 times [2021-06-10 21:31:35,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162800853] [2021-06-10 21:31:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:35,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:35,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:35,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:35,513 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:35,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:35,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162800853] [2021-06-10 21:31:35,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:35,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971023933] [2021-06-10 21:31:35,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:35,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:35,536 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 182 [2021-06-10 21:31:35,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 182 [2021-06-10 21:31:35,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,645 INFO L129 PetriNetUnfolder]: 52/177 cut-off events. [2021-06-10 21:31:35,645 INFO L130 PetriNetUnfolder]: For 694/700 co-relation queries the response was YES. [2021-06-10 21:31:35,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 177 events. 52/177 cut-off events. For 694/700 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 885 event pairs, 7 based on Foata normal form. 10/184 useless extension candidates. Maximal degree in co-relation 616. Up to 85 conditions per place. [2021-06-10 21:31:35,647 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 12 selfloop transitions, 11 changer transitions 3/42 dead transitions. [2021-06-10 21:31:35,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 281 flow [2021-06-10 21:31:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:31:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:31:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2021-06-10 21:31:35,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2021-06-10 21:31:35,650 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2021-06-10 21:31:35,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2021-06-10 21:31:35,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2021-06-10 21:31:35,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,654 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,654 INFO L185 Difference]: Start difference. First operand has 49 places, 30 transitions, 152 flow. Second operand 6 states and 791 transitions. [2021-06-10 21:31:35,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 281 flow [2021-06-10 21:31:35,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 268 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:35,657 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 212 flow [2021-06-10 21:31:35,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-06-10 21:31:35,657 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2021-06-10 21:31:35,657 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 212 flow [2021-06-10 21:31:35,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,658 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,658 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-10 21:31:35,658 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1533667253, now seen corresponding path program 1 times [2021-06-10 21:31:35,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637648312] [2021-06-10 21:31:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:31:35,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:35,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-10 21:31:35,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:35,782 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:35,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:35,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637648312] [2021-06-10 21:31:35,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:31:35,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618901281] [2021-06-10 21:31:35,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:31:35,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:31:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:31:35,801 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-10 21:31:35,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-10 21:31:35,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,934 INFO L129 PetriNetUnfolder]: 48/152 cut-off events. [2021-06-10 21:31:35,934 INFO L130 PetriNetUnfolder]: For 567/584 co-relation queries the response was YES. [2021-06-10 21:31:35,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 152 events. 48/152 cut-off events. For 567/584 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 680 event pairs, 7 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 608. Up to 85 conditions per place. [2021-06-10 21:31:35,935 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 13 selfloop transitions, 8 changer transitions 3/40 dead transitions. [2021-06-10 21:31:35,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 40 transitions, 297 flow [2021-06-10 21:31:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:31:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:31:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 781 transitions. [2021-06-10 21:31:35,938 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7152014652014652 [2021-06-10 21:31:35,938 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 781 transitions. [2021-06-10 21:31:35,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 781 transitions. [2021-06-10 21:31:35,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 781 transitions. [2021-06-10 21:31:35,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,944 INFO L185 Difference]: Start difference. First operand has 52 places, 36 transitions, 212 flow. Second operand 6 states and 781 transitions. [2021-06-10 21:31:35,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 40 transitions, 297 flow [2021-06-10 21:31:35,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 40 transitions, 275 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:35,947 INFO L241 Difference]: Finished difference. Result has 57 places, 36 transitions, 222 flow [2021-06-10 21:31:35,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2021-06-10 21:31:35,947 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2021-06-10 21:31:35,947 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 222 flow [2021-06-10 21:31:35,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,947 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,948 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-10 21:31:35,948 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1401096123, now seen corresponding path program 2 times [2021-06-10 21:31:35,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590947749] [2021-06-10 21:31:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:36,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:36,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:36,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:36,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:36,044 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:36,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:36,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590947749] [2021-06-10 21:31:36,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:36,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:36,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818990957] [2021-06-10 21:31:36,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:36,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:36,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:36,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 182 [2021-06-10 21:31:36,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:36,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 182 [2021-06-10 21:31:36,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:36,198 INFO L129 PetriNetUnfolder]: 60/195 cut-off events. [2021-06-10 21:31:36,198 INFO L130 PetriNetUnfolder]: For 953/961 co-relation queries the response was YES. [2021-06-10 21:31:36,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 195 events. 60/195 cut-off events. For 953/961 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 997 event pairs, 15 based on Foata normal form. 12/203 useless extension candidates. Maximal degree in co-relation 798. Up to 97 conditions per place. [2021-06-10 21:31:36,201 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 12 selfloop transitions, 15 changer transitions 5/48 dead transitions. [2021-06-10 21:31:36,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 402 flow [2021-06-10 21:31:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:31:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:31:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2021-06-10 21:31:36,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.749607535321821 [2021-06-10 21:31:36,204 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2021-06-10 21:31:36,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2021-06-10 21:31:36,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:36,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2021-06-10 21:31:36,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,210 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,210 INFO L185 Difference]: Start difference. First operand has 57 places, 36 transitions, 222 flow. Second operand 7 states and 955 transitions. [2021-06-10 21:31:36,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 402 flow [2021-06-10 21:31:36,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 372 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-10 21:31:36,217 INFO L241 Difference]: Finished difference. Result has 59 places, 42 transitions, 311 flow [2021-06-10 21:31:36,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2021-06-10 21:31:36,217 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2021-06-10 21:31:36,217 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 311 flow [2021-06-10 21:31:36,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:36,218 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:36,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-10 21:31:36,218 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:36,218 INFO L82 PathProgramCache]: Analyzing trace with hash 151437231, now seen corresponding path program 3 times [2021-06-10 21:31:36,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:36,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429062037] [2021-06-10 21:31:36,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:36,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:36,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:36,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:36,314 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-06-10 21:31:36,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-10 21:31:36,343 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:36,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:36,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429062037] [2021-06-10 21:31:36,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:36,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:31:36,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787512170] [2021-06-10 21:31:36,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:31:36,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:36,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:31:36,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:31:36,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-10 21:31:36,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 311 flow. Second operand has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:36,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-10 21:31:36,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:36,530 INFO L129 PetriNetUnfolder]: 54/186 cut-off events. [2021-06-10 21:31:36,530 INFO L130 PetriNetUnfolder]: For 1150/1173 co-relation queries the response was YES. [2021-06-10 21:31:36,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 186 events. 54/186 cut-off events. For 1150/1173 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 993 event pairs, 3 based on Foata normal form. 28/210 useless extension candidates. Maximal degree in co-relation 849. Up to 80 conditions per place. [2021-06-10 21:31:36,532 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 18 selfloop transitions, 15 changer transitions 6/55 dead transitions. [2021-06-10 21:31:36,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 532 flow [2021-06-10 21:31:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:31:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:31:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2021-06-10 21:31:36,535 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.716640502354788 [2021-06-10 21:31:36,535 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2021-06-10 21:31:36,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2021-06-10 21:31:36,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:36,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2021-06-10 21:31:36,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,540 INFO L185 Difference]: Start difference. First operand has 59 places, 42 transitions, 311 flow. Second operand 7 states and 913 transitions. [2021-06-10 21:31:36,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 532 flow [2021-06-10 21:31:36,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 491 flow, removed 20 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:36,546 INFO L241 Difference]: Finished difference. Result has 63 places, 45 transitions, 372 flow [2021-06-10 21:31:36,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2021-06-10 21:31:36,547 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2021-06-10 21:31:36,547 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 372 flow [2021-06-10 21:31:36,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:36,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:36,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-10 21:31:36,547 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1954267162, now seen corresponding path program 1 times [2021-06-10 21:31:36,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:36,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967065650] [2021-06-10 21:31:36,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:36,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:36,617 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:31:36,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:36,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:36,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967065650] [2021-06-10 21:31:36,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:36,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:31:36,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057374755] [2021-06-10 21:31:36,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:31:36,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:31:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:31:36,628 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:36,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:36,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:36,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:36,760 INFO L129 PetriNetUnfolder]: 210/449 cut-off events. [2021-06-10 21:31:36,760 INFO L130 PetriNetUnfolder]: For 1873/2015 co-relation queries the response was YES. [2021-06-10 21:31:36,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 449 events. 210/449 cut-off events. For 1873/2015 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 2751 event pairs, 49 based on Foata normal form. 76/452 useless extension candidates. Maximal degree in co-relation 1648. Up to 182 conditions per place. [2021-06-10 21:31:36,766 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 11 selfloop transitions, 10 changer transitions 1/56 dead transitions. [2021-06-10 21:31:36,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 436 flow [2021-06-10 21:31:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-06-10 21:31:36,768 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2021-06-10 21:31:36,768 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-06-10 21:31:36,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-06-10 21:31:36,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:36,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-06-10 21:31:36,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,772 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,772 INFO L185 Difference]: Start difference. First operand has 63 places, 45 transitions, 372 flow. Second operand 5 states and 730 transitions. [2021-06-10 21:31:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 436 flow [2021-06-10 21:31:36,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 400 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-06-10 21:31:36,779 INFO L241 Difference]: Finished difference. Result has 64 places, 52 transitions, 410 flow [2021-06-10 21:31:36,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2021-06-10 21:31:36,779 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2021-06-10 21:31:36,779 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 410 flow [2021-06-10 21:31:36,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:36,780 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:36,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-10 21:31:36,780 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:36,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1880739766, now seen corresponding path program 1 times [2021-06-10 21:31:36,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:36,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684977290] [2021-06-10 21:31:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:36,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:36,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:36,831 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:31:36,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:36,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:36,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684977290] [2021-06-10 21:31:36,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:36,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:36,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254271896] [2021-06-10 21:31:36,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:31:36,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:31:36,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:31:36,841 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:36,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 410 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:36,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:36,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:36,929 INFO L129 PetriNetUnfolder]: 131/326 cut-off events. [2021-06-10 21:31:36,929 INFO L130 PetriNetUnfolder]: For 1702/2268 co-relation queries the response was YES. [2021-06-10 21:31:36,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 326 events. 131/326 cut-off events. For 1702/2268 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1915 event pairs, 9 based on Foata normal form. 151/443 useless extension candidates. Maximal degree in co-relation 1389. Up to 176 conditions per place. [2021-06-10 21:31:36,933 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 6 selfloop transitions, 18 changer transitions 3/57 dead transitions. [2021-06-10 21:31:36,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 57 transitions, 473 flow [2021-06-10 21:31:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:31:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:31:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1022 transitions. [2021-06-10 21:31:36,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2021-06-10 21:31:36,936 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1022 transitions. [2021-06-10 21:31:36,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1022 transitions. [2021-06-10 21:31:36,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:36,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1022 transitions. [2021-06-10 21:31:36,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,942 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,942 INFO L185 Difference]: Start difference. First operand has 64 places, 52 transitions, 410 flow. Second operand 7 states and 1022 transitions. [2021-06-10 21:31:36,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 57 transitions, 473 flow [2021-06-10 21:31:36,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 460 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:36,948 INFO L241 Difference]: Finished difference. Result has 70 places, 54 transitions, 460 flow [2021-06-10 21:31:36,948 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2021-06-10 21:31:36,948 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2021-06-10 21:31:36,948 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 54 transitions, 460 flow [2021-06-10 21:31:36,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:36,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:36,949 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:36,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-10 21:31:36,949 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1981925005, now seen corresponding path program 1 times [2021-06-10 21:31:36,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:36,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893465515] [2021-06-10 21:31:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:36,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:36,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:36,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:36,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:37,003 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:31:37,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:37,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:37,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:37,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893465515] [2021-06-10 21:31:37,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:37,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:31:37,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745850280] [2021-06-10 21:31:37,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:37,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:37,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:37,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:37,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 54 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:37,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:37,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:37,118 INFO L129 PetriNetUnfolder]: 89/247 cut-off events. [2021-06-10 21:31:37,119 INFO L130 PetriNetUnfolder]: For 1746/2458 co-relation queries the response was YES. [2021-06-10 21:31:37,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 247 events. 89/247 cut-off events. For 1746/2458 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1452 event pairs, 0 based on Foata normal form. 143/354 useless extension candidates. Maximal degree in co-relation 1250. Up to 149 conditions per place. [2021-06-10 21:31:37,122 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 2 selfloop transitions, 22 changer transitions 4/57 dead transitions. [2021-06-10 21:31:37,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 57 transitions, 526 flow [2021-06-10 21:31:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 21:31:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 21:31:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1308 transitions. [2021-06-10 21:31:37,126 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2021-06-10 21:31:37,126 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1308 transitions. [2021-06-10 21:31:37,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1308 transitions. [2021-06-10 21:31:37,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:37,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1308 transitions. [2021-06-10 21:31:37,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.33333333333334) internal successors, (1308), 9 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,133 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,133 INFO L185 Difference]: Start difference. First operand has 70 places, 54 transitions, 460 flow. Second operand 9 states and 1308 transitions. [2021-06-10 21:31:37,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 57 transitions, 526 flow [2021-06-10 21:31:37,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 57 transitions, 436 flow, removed 32 selfloop flow, removed 9 redundant places. [2021-06-10 21:31:37,139 INFO L241 Difference]: Finished difference. Result has 72 places, 53 transitions, 412 flow [2021-06-10 21:31:37,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=412, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2021-06-10 21:31:37,140 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2021-06-10 21:31:37,140 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 412 flow [2021-06-10 21:31:37,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,140 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:37,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:37,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-10 21:31:37,141 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2079703985, now seen corresponding path program 1 times [2021-06-10 21:31:37,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:37,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140451985] [2021-06-10 21:31:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:37,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:37,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:37,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:37,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:37,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:37,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:37,188 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:37,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:37,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140451985] [2021-06-10 21:31:37,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:37,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:37,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719124374] [2021-06-10 21:31:37,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:31:37,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:31:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:31:37,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:37,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:37,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:37,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:37,281 INFO L129 PetriNetUnfolder]: 160/432 cut-off events. [2021-06-10 21:31:37,281 INFO L130 PetriNetUnfolder]: For 2022/2271 co-relation queries the response was YES. [2021-06-10 21:31:37,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 432 events. 160/432 cut-off events. For 2022/2271 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 3046 event pairs, 0 based on Foata normal form. 16/378 useless extension candidates. Maximal degree in co-relation 1839. Up to 184 conditions per place. [2021-06-10 21:31:37,285 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 4 selfloop transitions, 2 changer transitions 10/55 dead transitions. [2021-06-10 21:31:37,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 55 transitions, 432 flow [2021-06-10 21:31:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2021-06-10 21:31:37,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.789010989010989 [2021-06-10 21:31:37,288 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2021-06-10 21:31:37,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2021-06-10 21:31:37,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:37,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2021-06-10 21:31:37,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,292 INFO L185 Difference]: Start difference. First operand has 72 places, 53 transitions, 412 flow. Second operand 5 states and 718 transitions. [2021-06-10 21:31:37,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 55 transitions, 432 flow [2021-06-10 21:31:37,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 55 transitions, 364 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-10 21:31:37,306 INFO L241 Difference]: Finished difference. Result has 70 places, 45 transitions, 289 flow [2021-06-10 21:31:37,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2021-06-10 21:31:37,306 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 35 predicate places. [2021-06-10 21:31:37,306 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 289 flow [2021-06-10 21:31:37,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:37,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:37,307 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:37,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-10 21:31:37,307 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1161594023, now seen corresponding path program 2 times [2021-06-10 21:31:37,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:37,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730414542] [2021-06-10 21:31:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:31:37,337 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:31:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:31:37,368 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:31:37,392 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 21:31:37,393 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 21:31:37,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-10 21:31:37,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 09:31:37 BasicIcfg [2021-06-10 21:31:37,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 21:31:37,451 INFO L168 Benchmark]: Toolchain (without parser) took 11760.71 ms. Allocated memory was 377.5 MB in the beginning and 583.0 MB in the end (delta: 205.5 MB). Free memory was 339.8 MB in the beginning and 336.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 207.6 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:37,451 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 377.5 MB. Free memory was 358.0 MB in the beginning and 357.9 MB in the end (delta: 70.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 21:31:37,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.35 ms. Allocated memory is still 377.5 MB. Free memory was 339.5 MB in the beginning and 335.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:37,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.17 ms. Allocated memory is still 377.5 MB. Free memory was 335.8 MB in the beginning and 332.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:37,451 INFO L168 Benchmark]: Boogie Preprocessor took 56.46 ms. Allocated memory is still 377.5 MB. Free memory was 332.6 MB in the beginning and 330.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:37,451 INFO L168 Benchmark]: RCFGBuilder took 1783.79 ms. Allocated memory is still 377.5 MB. Free memory was 330.5 MB in the beginning and 303.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:37,452 INFO L168 Benchmark]: TraceAbstraction took 9269.57 ms. Allocated memory was 377.5 MB in the beginning and 583.0 MB in the end (delta: 205.5 MB). Free memory was 302.5 MB in the beginning and 336.9 MB in the end (delta: -34.4 MB). Peak memory consumption was 171.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:37,452 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 377.5 MB. Free memory was 358.0 MB in the beginning and 357.9 MB in the end (delta: 70.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 561.35 ms. Allocated memory is still 377.5 MB. Free memory was 339.5 MB in the beginning and 335.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 82.17 ms. Allocated memory is still 377.5 MB. Free memory was 335.8 MB in the beginning and 332.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.46 ms. Allocated memory is still 377.5 MB. Free memory was 332.6 MB in the beginning and 330.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1783.79 ms. Allocated memory is still 377.5 MB. Free memory was 330.5 MB in the beginning and 303.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9269.57 ms. Allocated memory was 377.5 MB in the beginning and 583.0 MB in the end (delta: 205.5 MB). Free memory was 302.5 MB in the beginning and 336.9 MB in the end (delta: -34.4 MB). Peak memory consumption was 171.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5557.9ms, 101 PlacesBefore, 35 PlacesAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 4059 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2092, positive: 1955, positive conditional: 0, positive unconditional: 1955, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1154, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, positive: 1106, positive conditional: 0, positive unconditional: 1106, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 543, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 511, negative conditional: 0, negative unconditional: 511, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2092, positive: 834, positive conditional: 0, positive unconditional: 834, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 1975, Positive cache size: 1942, Positive conditional cache size: 0, Positive unconditional cache size: 1942, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 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) [L793] 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) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 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 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L764] 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) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] 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) [L764] 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) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 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 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] 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) [L838] 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)) [L838] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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) [L839] 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)) [L839] 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)) [L840] 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)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L840] 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)) [L840] 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)) [L841] 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)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9117.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1778.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5628.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 65 SDslu, 65 SDs, 0 SdLazy, 418 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 546.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 590.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.8ms SsaConstructionTime, 438.5ms SatisfiabilityAnalysisTime, 981.3ms InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...