/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:14:11,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:14:11,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:14:11,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:14:11,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:14:11,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:14:11,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:14:11,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:14:11,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:14:11,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:14:11,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:14:11,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:14:11,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:14:11,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:14:11,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:14:11,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:14:11,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:14:11,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:14:11,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:14:11,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:14:11,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:14:11,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:14:11,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:14:11,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:14:11,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:14:11,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:14:11,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:14:11,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:14:11,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:14:11,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:14:11,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:14:11,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:14:11,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:14:11,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:14:11,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:14:11,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:14:11,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:14:11,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:14:11,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:14:11,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:14:11,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:14:11,372 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:14:11,406 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:14:11,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:14:11,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:14:11,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:14:11,410 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:14:11,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:14:11,411 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:14:11,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:14:11,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:14:11,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:14:11,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:14:11,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:14:11,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:14:11,413 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:14:11,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:14:11,413 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:14:11,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:14:11,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:14:11,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:14:11,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:14:11,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:14:11,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:11,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:14:11,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:14:11,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:14:11,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:14:11,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:14:11,415 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:14:11,416 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:14:11,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:14:11,416 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-03-26 10:14:11,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:14:11,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:14:11,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:14:11,773 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:14:11,774 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:14:11,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2021-03-26 10:14:11,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4c69e40/3998980afe87455484549e947998a4bf/FLAG57511b26a [2021-03-26 10:14:12,385 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:14:12,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2021-03-26 10:14:12,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4c69e40/3998980afe87455484549e947998a4bf/FLAG57511b26a [2021-03-26 10:14:12,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4c69e40/3998980afe87455484549e947998a4bf [2021-03-26 10:14:12,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:14:12,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:14:12,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:12,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:14:12,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:14:12,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:12" (1/1) ... [2021-03-26 10:14:12,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184c72e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:12, skipping insertion in model container [2021-03-26 10:14:12,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:12" (1/1) ... [2021-03-26 10:14:12,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:14:12,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:14:12,845 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/mix054_tso.opt.i[948,961] [2021-03-26 10:14:13,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:13,100 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:14:13,113 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/mix054_tso.opt.i[948,961] [2021-03-26 10:14:13,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:13,238 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:14:13,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13 WrapperNode [2021-03-26 10:14:13,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:13,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:13,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:14:13,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:14:13,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:13,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:14:13,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:14:13,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:14:13,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (1/1) ... [2021-03-26 10:14:13,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:14:13,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:14:13,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:14:13,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:14:13,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (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-03-26 10:14:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:14:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:14:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:14:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:14:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:14:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:14:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:14:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:14:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:14:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:14:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:14:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:14:13,468 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:14:14,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:14:14,932 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:14:14,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:14 BoogieIcfgContainer [2021-03-26 10:14:14,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:14:14,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:14:14,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:14:14,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:14:14,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:14:12" (1/3) ... [2021-03-26 10:14:14,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad7c327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:14, skipping insertion in model container [2021-03-26 10:14:14,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:13" (2/3) ... [2021-03-26 10:14:14,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad7c327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:14, skipping insertion in model container [2021-03-26 10:14:14,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:14" (3/3) ... [2021-03-26 10:14:14,940 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2021-03-26 10:14:14,945 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:14:14,948 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:14:14,949 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:14:14,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,973 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,973 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:14,988 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:14:15,005 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:14:15,023 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:14:15,023 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:14:15,023 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:14:15,023 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:14:15,023 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:14:15,023 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:14:15,024 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:14:15,024 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:14:15,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 10:14:15,059 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 10:14:15,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:15,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:14:15,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 10:14:15,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:15,067 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:15,079 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:15,082 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:15,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-26 10:14:15,096 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 10:14:15,097 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:15,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:14:15,099 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 10:14:15,984 WARN L205 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 10:14:16,316 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 10:14:17,815 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 10:14:18,442 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 10:14:19,369 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:14:19,802 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:14:19,940 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:14:21,291 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 10:14:21,652 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 10:14:22,858 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 263 DAG size of output: 262 [2021-03-26 10:14:23,444 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 10:14:23,795 INFO L154 LiptonReduction]: Checked pairs total: 1544 [2021-03-26 10:14:23,795 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-26 10:14:23,797 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8731 [2021-03-26 10:14:23,809 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 10:14:23,810 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:23,810 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:23,810 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:23,811 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1685503753, now seen corresponding path program 1 times [2021-03-26 10:14:23,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:23,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219611967] [2021-03-26 10:14:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:24,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:24,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:24,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:24,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219611967] [2021-03-26 10:14:24,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:24,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:24,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653789675] [2021-03-26 10:14:24,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:24,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:24,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:24,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2021-03-26 10:14:24,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-03-26 10:14:24,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:24,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2021-03-26 10:14:24,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:24,116 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 10:14:24,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:24,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 335 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 131. Up to 37 conditions per place. [2021-03-26 10:14:24,119 INFO L132 encePairwiseOnDemand]: 132/136 looper letters, 7 selfloop transitions, 2 changer transitions 5/31 dead transitions. [2021-03-26 10:14:24,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 90 flow [2021-03-26 10:14:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-26 10:14:24,135 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2021-03-26 10:14:24,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-26 10:14:24,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-26 10:14:24,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:24,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-26 10:14:24,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-03-26 10:14:24,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-03-26 10:14:24,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-03-26 10:14:24,149 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 356 transitions. [2021-03-26 10:14:24,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 90 flow [2021-03-26 10:14:24,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:24,153 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 54 flow [2021-03-26 10:14:24,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 10:14:24,155 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-26 10:14:24,155 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:24,156 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 54 flow [2021-03-26 10:14:24,156 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 54 flow [2021-03-26 10:14:24,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 54 flow [2021-03-26 10:14:24,159 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:14:24,160 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:24,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:14:24,160 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:14:25,018 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-03-26 10:14:25,327 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:14:26,002 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:14:26,690 WARN L205 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:14:27,647 INFO L154 LiptonReduction]: Checked pairs total: 536 [2021-03-26 10:14:27,647 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 10:14:27,647 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3492 [2021-03-26 10:14:27,648 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-03-26 10:14:27,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-03-26 10:14:27,649 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:27,649 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:27,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:14:27,649 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1168850318, now seen corresponding path program 1 times [2021-03-26 10:14:27,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:27,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516138426] [2021-03-26 10:14:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:27,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:27,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:27,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:27,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:27,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:27,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:27,808 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:14:27,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:14:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:27,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516138426] [2021-03-26 10:14:27,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:27,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:14:27,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949382511] [2021-03-26 10:14:27,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:14:27,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:14:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:14:27,819 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 143 [2021-03-26 10:14:27,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 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-03-26 10:14:27,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:27,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 143 [2021-03-26 10:14:27,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:27,884 INFO L129 PetriNetUnfolder]: 28/75 cut-off events. [2021-03-26 10:14:27,884 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-26 10:14:27,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 75 events. 28/75 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 261 event pairs, 11 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 136. Up to 52 conditions per place. [2021-03-26 10:14:27,886 INFO L132 encePairwiseOnDemand]: 137/143 looper letters, 7 selfloop transitions, 7 changer transitions 0/23 dead transitions. [2021-03-26 10:14:27,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 84 flow [2021-03-26 10:14:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2021-03-26 10:14:27,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7395104895104895 [2021-03-26 10:14:27,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2021-03-26 10:14:27,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2021-03-26 10:14:27,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:27,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2021-03-26 10:14:27,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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-03-26 10:14:27,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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-03-26 10:14:27,908 INFO L81 ComplementDD]: Finished complementDD. Result 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-03-26 10:14:27,908 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 4 states and 423 transitions. [2021-03-26 10:14:27,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 84 flow [2021-03-26 10:14:27,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:27,910 INFO L241 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2021-03-26 10:14:27,910 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2021-03-26 10:14:27,910 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2021-03-26 10:14:27,910 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:27,910 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 22 transitions, 82 flow [2021-03-26 10:14:27,911 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 82 flow [2021-03-26 10:14:27,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 82 flow [2021-03-26 10:14:27,925 INFO L129 PetriNetUnfolder]: 9/47 cut-off events. [2021-03-26 10:14:27,926 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:14:27,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 47 events. 9/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 141 event pairs, 2 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 82. Up to 16 conditions per place. [2021-03-26 10:14:27,927 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-26 10:14:28,220 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 10:14:28,340 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:14:28,594 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 10:14:28,716 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:14:28,797 INFO L154 LiptonReduction]: Checked pairs total: 176 [2021-03-26 10:14:28,797 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:28,798 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 888 [2021-03-26 10:14:28,798 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 80 flow [2021-03-26 10:14:28,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 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-03-26 10:14:28,799 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:28,799 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:28,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:14:28,800 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:28,800 INFO L82 PathProgramCache]: Analyzing trace with hash 863115089, now seen corresponding path program 1 times [2021-03-26 10:14:28,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:28,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544797341] [2021-03-26 10:14:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:28,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:28,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:14:29,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:29,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:14:29,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:29,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:29,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544797341] [2021-03-26 10:14:29,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:29,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:29,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394129607] [2021-03-26 10:14:29,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:29,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:29,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:29,020 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2021-03-26 10:14:29,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-03-26 10:14:29,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:29,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2021-03-26 10:14:29,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:29,070 INFO L129 PetriNetUnfolder]: 25/70 cut-off events. [2021-03-26 10:14:29,070 INFO L130 PetriNetUnfolder]: For 36/39 co-relation queries the response was YES. [2021-03-26 10:14:29,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 70 events. 25/70 cut-off events. For 36/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 240 event pairs, 16 based on Foata normal form. 3/71 useless extension candidates. Maximal degree in co-relation 177. Up to 47 conditions per place. [2021-03-26 10:14:29,071 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 9 selfloop transitions, 6 changer transitions 0/23 dead transitions. [2021-03-26 10:14:29,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 23 transitions, 117 flow [2021-03-26 10:14:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2021-03-26 10:14:29,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2021-03-26 10:14:29,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2021-03-26 10:14:29,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2021-03-26 10:14:29,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:29,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2021-03-26 10:14:29,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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-03-26 10:14:29,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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-03-26 10:14:29,076 INFO L81 ComplementDD]: Finished complementDD. Result 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-03-26 10:14:29,077 INFO L185 Difference]: Start difference. First operand has 25 places, 21 transitions, 80 flow. Second operand 3 states and 345 transitions. [2021-03-26 10:14:29,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 23 transitions, 117 flow [2021-03-26 10:14:29,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 117 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:14:29,078 INFO L241 Difference]: Finished difference. Result has 28 places, 22 transitions, 107 flow [2021-03-26 10:14:29,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2021-03-26 10:14:29,079 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2021-03-26 10:14:29,079 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:29,079 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 107 flow [2021-03-26 10:14:29,079 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 107 flow [2021-03-26 10:14:29,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 107 flow [2021-03-26 10:14:29,087 INFO L129 PetriNetUnfolder]: 11/44 cut-off events. [2021-03-26 10:14:29,087 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 10:14:29,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 44 events. 11/44 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 4 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 106. Up to 18 conditions per place. [2021-03-26 10:14:29,088 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 10:14:29,090 INFO L154 LiptonReduction]: Checked pairs total: 115 [2021-03-26 10:14:29,090 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:29,090 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 10:14:29,091 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 107 flow [2021-03-26 10:14:29,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-03-26 10:14:29,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:29,091 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:29,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:14:29,092 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1820958849, now seen corresponding path program 1 times [2021-03-26 10:14:29,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:29,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326611315] [2021-03-26 10:14:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:29,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:29,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:29,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:29,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:29,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:29,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:14:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:29,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326611315] [2021-03-26 10:14:29,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:29,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:29,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313096565] [2021-03-26 10:14:29,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:29,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:29,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2021-03-26 10:14:29,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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-03-26 10:14:29,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:29,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2021-03-26 10:14:29,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:29,264 INFO L129 PetriNetUnfolder]: 23/67 cut-off events. [2021-03-26 10:14:29,264 INFO L130 PetriNetUnfolder]: For 69/72 co-relation queries the response was YES. [2021-03-26 10:14:29,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 67 events. 23/67 cut-off events. For 69/72 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 223 event pairs, 7 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 196. Up to 40 conditions per place. [2021-03-26 10:14:29,265 INFO L132 encePairwiseOnDemand]: 138/144 looper letters, 12 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2021-03-26 10:14:29,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 161 flow [2021-03-26 10:14:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2021-03-26 10:14:29,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7899305555555556 [2021-03-26 10:14:29,268 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2021-03-26 10:14:29,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2021-03-26 10:14:29,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:29,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2021-03-26 10:14:29,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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-03-26 10:14:29,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 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-03-26 10:14:29,271 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 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-03-26 10:14:29,271 INFO L185 Difference]: Start difference. First operand has 28 places, 22 transitions, 107 flow. Second operand 4 states and 455 transitions. [2021-03-26 10:14:29,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 161 flow [2021-03-26 10:14:29,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 153 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:29,273 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 141 flow [2021-03-26 10:14:29,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-26 10:14:29,274 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2021-03-26 10:14:29,274 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:29,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 141 flow [2021-03-26 10:14:29,274 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 141 flow [2021-03-26 10:14:29,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 141 flow [2021-03-26 10:14:29,284 INFO L129 PetriNetUnfolder]: 20/62 cut-off events. [2021-03-26 10:14:29,284 INFO L130 PetriNetUnfolder]: For 74/75 co-relation queries the response was YES. [2021-03-26 10:14:29,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 62 events. 20/62 cut-off events. For 74/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 207 event pairs, 5 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 181. Up to 26 conditions per place. [2021-03-26 10:14:29,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 100 [2021-03-26 10:14:29,492 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:14:29,898 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-26 10:14:30,029 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:14:30,076 INFO L154 LiptonReduction]: Checked pairs total: 224 [2021-03-26 10:14:30,076 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:30,076 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 802 [2021-03-26 10:14:30,077 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 146 flow [2021-03-26 10:14:30,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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-03-26 10:14:30,077 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:30,077 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:30,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:14:30,078 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash 263874266, now seen corresponding path program 1 times [2021-03-26 10:14:30,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:30,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497380642] [2021-03-26 10:14:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:30,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:30,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:30,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:30,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:30,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497380642] [2021-03-26 10:14:30,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:30,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:30,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4746002] [2021-03-26 10:14:30,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:30,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:30,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:30,176 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2021-03-26 10:14:30,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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-03-26 10:14:30,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:30,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2021-03-26 10:14:30,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:30,234 INFO L129 PetriNetUnfolder]: 30/81 cut-off events. [2021-03-26 10:14:30,234 INFO L130 PetriNetUnfolder]: For 133/147 co-relation queries the response was YES. [2021-03-26 10:14:30,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 81 events. 30/81 cut-off events. For 133/147 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 295 event pairs, 6 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 292. Up to 50 conditions per place. [2021-03-26 10:14:30,235 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 11 selfloop transitions, 13 changer transitions 0/32 dead transitions. [2021-03-26 10:14:30,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 238 flow [2021-03-26 10:14:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2021-03-26 10:14:30,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7889655172413793 [2021-03-26 10:14:30,239 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2021-03-26 10:14:30,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2021-03-26 10:14:30,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:30,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2021-03-26 10:14:30,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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-03-26 10:14:30,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:30,244 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:30,245 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 146 flow. Second operand 5 states and 572 transitions. [2021-03-26 10:14:30,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 238 flow [2021-03-26 10:14:30,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 228 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:30,250 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 223 flow [2021-03-26 10:14:30,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-03-26 10:14:30,251 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-03-26 10:14:30,251 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:30,251 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 223 flow [2021-03-26 10:14:30,251 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 223 flow [2021-03-26 10:14:30,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 223 flow [2021-03-26 10:14:30,262 INFO L129 PetriNetUnfolder]: 29/80 cut-off events. [2021-03-26 10:14:30,263 INFO L130 PetriNetUnfolder]: For 199/203 co-relation queries the response was YES. [2021-03-26 10:14:30,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 80 events. 29/80 cut-off events. For 199/203 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 280 event pairs, 5 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 288. Up to 34 conditions per place. [2021-03-26 10:14:30,265 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-26 10:14:30,268 INFO L154 LiptonReduction]: Checked pairs total: 142 [2021-03-26 10:14:30,268 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:30,269 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 10:14:30,275 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 223 flow [2021-03-26 10:14:30,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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-03-26 10:14:30,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:30,276 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:30,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:14:30,276 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash 263906816, now seen corresponding path program 2 times [2021-03-26 10:14:30,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:30,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285471045] [2021-03-26 10:14:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:30,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:30,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:30,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:30,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:30,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-03-26 10:14:30,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285471045] [2021-03-26 10:14:30,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:30,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:30,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986084380] [2021-03-26 10:14:30,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:30,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:30,373 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2021-03-26 10:14:30,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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-03-26 10:14:30,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:30,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2021-03-26 10:14:30,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:30,428 INFO L129 PetriNetUnfolder]: 26/77 cut-off events. [2021-03-26 10:14:30,428 INFO L130 PetriNetUnfolder]: For 258/274 co-relation queries the response was YES. [2021-03-26 10:14:30,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 77 events. 26/77 cut-off events. For 258/274 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 286 event pairs, 5 based on Foata normal form. 9/85 useless extension candidates. Maximal degree in co-relation 320. Up to 42 conditions per place. [2021-03-26 10:14:30,429 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 15 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2021-03-26 10:14:30,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 288 flow [2021-03-26 10:14:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2021-03-26 10:14:30,431 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7879310344827586 [2021-03-26 10:14:30,431 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2021-03-26 10:14:30,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2021-03-26 10:14:30,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:30,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2021-03-26 10:14:30,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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-03-26 10:14:30,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-03-26 10:14:30,434 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-03-26 10:14:30,434 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 223 flow. Second operand 4 states and 457 transitions. [2021-03-26 10:14:30,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 288 flow [2021-03-26 10:14:30,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 277 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:30,438 INFO L241 Difference]: Finished difference. Result has 40 places, 32 transitions, 249 flow [2021-03-26 10:14:30,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2021-03-26 10:14:30,438 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2021-03-26 10:14:30,438 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:30,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 249 flow [2021-03-26 10:14:30,439 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 249 flow [2021-03-26 10:14:30,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 249 flow [2021-03-26 10:14:30,448 INFO L129 PetriNetUnfolder]: 24/75 cut-off events. [2021-03-26 10:14:30,448 INFO L130 PetriNetUnfolder]: For 247/251 co-relation queries the response was YES. [2021-03-26 10:14:30,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 75 events. 24/75 cut-off events. For 247/251 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 284 event pairs, 6 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 291. Up to 30 conditions per place. [2021-03-26 10:14:30,450 INFO L142 LiptonReduction]: Number of co-enabled transitions 116 [2021-03-26 10:14:30,456 INFO L154 LiptonReduction]: Checked pairs total: 205 [2021-03-26 10:14:30,456 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:30,456 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-26 10:14:30,459 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 249 flow [2021-03-26 10:14:30,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 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-03-26 10:14:30,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:30,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:30,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:14:30,459 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 263952107, now seen corresponding path program 1 times [2021-03-26 10:14:30,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:30,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040828691] [2021-03-26 10:14:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:30,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:30,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:30,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:14:30,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:14:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:30,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040828691] [2021-03-26 10:14:30,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:30,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:30,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048732582] [2021-03-26 10:14:30,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:30,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:30,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 145 [2021-03-26 10:14:30,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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-03-26 10:14:30,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:30,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 145 [2021-03-26 10:14:30,597 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:30,692 INFO L129 PetriNetUnfolder]: 27/91 cut-off events. [2021-03-26 10:14:30,692 INFO L130 PetriNetUnfolder]: For 368/384 co-relation queries the response was YES. [2021-03-26 10:14:30,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 91 events. 27/91 cut-off events. For 368/384 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 359 event pairs, 2 based on Foata normal form. 5/96 useless extension candidates. Maximal degree in co-relation 412. Up to 42 conditions per place. [2021-03-26 10:14:30,695 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 14 selfloop transitions, 16 changer transitions 0/38 dead transitions. [2021-03-26 10:14:30,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 367 flow [2021-03-26 10:14:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2021-03-26 10:14:30,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7682758620689655 [2021-03-26 10:14:30,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2021-03-26 10:14:30,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2021-03-26 10:14:30,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:30,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2021-03-26 10:14:30,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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-03-26 10:14:30,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:30,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:30,701 INFO L185 Difference]: Start difference. First operand has 40 places, 32 transitions, 249 flow. Second operand 5 states and 557 transitions. [2021-03-26 10:14:30,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 367 flow [2021-03-26 10:14:30,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 346 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:30,703 INFO L241 Difference]: Finished difference. Result has 43 places, 37 transitions, 337 flow [2021-03-26 10:14:30,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2021-03-26 10:14:30,704 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2021-03-26 10:14:30,704 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:30,704 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 337 flow [2021-03-26 10:14:30,704 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 337 flow [2021-03-26 10:14:30,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 337 flow [2021-03-26 10:14:30,716 INFO L129 PetriNetUnfolder]: 26/90 cut-off events. [2021-03-26 10:14:30,716 INFO L130 PetriNetUnfolder]: For 416/428 co-relation queries the response was YES. [2021-03-26 10:14:30,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 90 events. 26/90 cut-off events. For 416/428 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 372 event pairs, 6 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 386. Up to 35 conditions per place. [2021-03-26 10:14:30,717 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 10:14:30,723 INFO L154 LiptonReduction]: Checked pairs total: 287 [2021-03-26 10:14:30,723 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:30,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 10:14:30,724 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 337 flow [2021-03-26 10:14:30,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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-03-26 10:14:30,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:30,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:30,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:14:30,724 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -511496789, now seen corresponding path program 2 times [2021-03-26 10:14:30,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:30,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353658557] [2021-03-26 10:14:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:30,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:30,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:30,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:30,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:30,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:30,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353658557] [2021-03-26 10:14:30,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:30,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:30,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076010150] [2021-03-26 10:14:30,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:30,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:30,839 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2021-03-26 10:14:30,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 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-03-26 10:14:30,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:30,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2021-03-26 10:14:30,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:30,922 INFO L129 PetriNetUnfolder]: 29/100 cut-off events. [2021-03-26 10:14:30,922 INFO L130 PetriNetUnfolder]: For 524/556 co-relation queries the response was YES. [2021-03-26 10:14:30,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 100 events. 29/100 cut-off events. For 524/556 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 432 event pairs, 0 based on Foata normal form. 12/112 useless extension candidates. Maximal degree in co-relation 496. Up to 55 conditions per place. [2021-03-26 10:14:30,923 INFO L132 encePairwiseOnDemand]: 138/145 looper letters, 24 selfloop transitions, 13 changer transitions 0/45 dead transitions. [2021-03-26 10:14:30,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 491 flow [2021-03-26 10:14:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2021-03-26 10:14:30,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7406896551724138 [2021-03-26 10:14:30,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2021-03-26 10:14:30,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2021-03-26 10:14:30,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:30,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2021-03-26 10:14:30,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 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-03-26 10:14:30,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:30,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:30,929 INFO L185 Difference]: Start difference. First operand has 43 places, 37 transitions, 337 flow. Second operand 5 states and 537 transitions. [2021-03-26 10:14:30,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 491 flow [2021-03-26 10:14:30,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 464 flow, removed 13 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:30,932 INFO L241 Difference]: Finished difference. Result has 47 places, 41 transitions, 402 flow [2021-03-26 10:14:30,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2021-03-26 10:14:30,933 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2021-03-26 10:14:30,933 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:30,933 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 402 flow [2021-03-26 10:14:30,933 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 402 flow [2021-03-26 10:14:30,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 402 flow [2021-03-26 10:14:30,946 INFO L129 PetriNetUnfolder]: 29/100 cut-off events. [2021-03-26 10:14:30,946 INFO L130 PetriNetUnfolder]: For 461/469 co-relation queries the response was YES. [2021-03-26 10:14:30,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 100 events. 29/100 cut-off events. For 461/469 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 426 event pairs, 5 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 440. Up to 38 conditions per place. [2021-03-26 10:14:30,947 INFO L142 LiptonReduction]: Number of co-enabled transitions 140 [2021-03-26 10:14:30,953 INFO L154 LiptonReduction]: Checked pairs total: 387 [2021-03-26 10:14:30,953 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:30,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:14:30,954 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 402 flow [2021-03-26 10:14:30,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 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-03-26 10:14:30,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:30,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:30,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:14:30,954 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -408824739, now seen corresponding path program 1 times [2021-03-26 10:14:30,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:30,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354291935] [2021-03-26 10:14:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:31,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:31,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:31,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:31,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:14:31,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:14:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:31,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354291935] [2021-03-26 10:14:31,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:31,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:31,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979876743] [2021-03-26 10:14:31,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:31,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:31,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 145 [2021-03-26 10:14:31,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 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-03-26 10:14:31,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:31,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 145 [2021-03-26 10:14:31,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:31,199 INFO L129 PetriNetUnfolder]: 25/96 cut-off events. [2021-03-26 10:14:31,200 INFO L130 PetriNetUnfolder]: For 538/560 co-relation queries the response was YES. [2021-03-26 10:14:31,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 96 events. 25/96 cut-off events. For 538/560 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 422 event pairs, 0 based on Foata normal form. 9/105 useless extension candidates. Maximal degree in co-relation 476. Up to 35 conditions per place. [2021-03-26 10:14:31,201 INFO L132 encePairwiseOnDemand]: 139/145 looper letters, 12 selfloop transitions, 26 changer transitions 0/46 dead transitions. [2021-03-26 10:14:31,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 519 flow [2021-03-26 10:14:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2021-03-26 10:14:31,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.722167487684729 [2021-03-26 10:14:31,204 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2021-03-26 10:14:31,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2021-03-26 10:14:31,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:31,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2021-03-26 10:14:31,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 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-03-26 10:14:31,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 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-03-26 10:14:31,208 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 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-03-26 10:14:31,208 INFO L185 Difference]: Start difference. First operand has 47 places, 41 transitions, 402 flow. Second operand 7 states and 733 transitions. [2021-03-26 10:14:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 519 flow [2021-03-26 10:14:31,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 497 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:31,211 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 458 flow [2021-03-26 10:14:31,211 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-03-26 10:14:31,211 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2021-03-26 10:14:31,211 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:31,212 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 458 flow [2021-03-26 10:14:31,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 458 flow [2021-03-26 10:14:31,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 458 flow [2021-03-26 10:14:31,224 INFO L129 PetriNetUnfolder]: 25/97 cut-off events. [2021-03-26 10:14:31,224 INFO L130 PetriNetUnfolder]: For 575/586 co-relation queries the response was YES. [2021-03-26 10:14:31,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 97 events. 25/97 cut-off events. For 575/586 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 427 event pairs, 4 based on Foata normal form. 4/101 useless extension candidates. Maximal degree in co-relation 452. Up to 35 conditions per place. [2021-03-26 10:14:31,225 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-26 10:14:31,230 INFO L154 LiptonReduction]: Checked pairs total: 360 [2021-03-26 10:14:31,230 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:31,230 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 10:14:31,231 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 458 flow [2021-03-26 10:14:31,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 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-03-26 10:14:31,231 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:31,231 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:31,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:14:31,232 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash 263702402, now seen corresponding path program 1 times [2021-03-26 10:14:31,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:31,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182308846] [2021-03-26 10:14:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:31,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:31,266 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:14:31,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:31,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:31,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182308846] [2021-03-26 10:14:31,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:31,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:31,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741781176] [2021-03-26 10:14:31,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:31,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:31,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2021-03-26 10:14:31,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-03-26 10:14:31,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:31,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2021-03-26 10:14:31,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:31,311 INFO L129 PetriNetUnfolder]: 23/98 cut-off events. [2021-03-26 10:14:31,311 INFO L130 PetriNetUnfolder]: For 543/577 co-relation queries the response was YES. [2021-03-26 10:14:31,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 98 events. 23/98 cut-off events. For 543/577 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 444 event pairs, 5 based on Foata normal form. 42/138 useless extension candidates. Maximal degree in co-relation 410. Up to 44 conditions per place. [2021-03-26 10:14:31,312 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 5 selfloop transitions, 6 changer transitions 4/40 dead transitions. [2021-03-26 10:14:31,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 397 flow [2021-03-26 10:14:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2021-03-26 10:14:31,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8124137931034483 [2021-03-26 10:14:31,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2021-03-26 10:14:31,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2021-03-26 10:14:31,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:31,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2021-03-26 10:14:31,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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-03-26 10:14:31,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:31,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 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-03-26 10:14:31,317 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 458 flow. Second operand 5 states and 589 transitions. [2021-03-26 10:14:31,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 397 flow [2021-03-26 10:14:31,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 345 flow, removed 13 selfloop flow, removed 6 redundant places. [2021-03-26 10:14:31,320 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 326 flow [2021-03-26 10:14:31,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-03-26 10:14:31,320 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2021-03-26 10:14:31,321 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:31,321 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 326 flow [2021-03-26 10:14:31,321 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 326 flow [2021-03-26 10:14:31,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 36 transitions, 326 flow [2021-03-26 10:14:31,331 INFO L129 PetriNetUnfolder]: 12/80 cut-off events. [2021-03-26 10:14:31,331 INFO L130 PetriNetUnfolder]: For 364/374 co-relation queries the response was YES. [2021-03-26 10:14:31,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 80 events. 12/80 cut-off events. For 364/374 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 368 event pairs, 1 based on Foata normal form. 4/84 useless extension candidates. Maximal degree in co-relation 348. Up to 23 conditions per place. [2021-03-26 10:14:31,332 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-26 10:14:31,334 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 10:14:31,334 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:31,335 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 10:14:31,335 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 326 flow [2021-03-26 10:14:31,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-03-26 10:14:31,336 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:31,336 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:31,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:14:31,336 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1778551802, now seen corresponding path program 1 times [2021-03-26 10:14:31,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:31,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719377328] [2021-03-26 10:14:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:31,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:31,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:31,376 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:14:31,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:31,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:31,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:31,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719377328] [2021-03-26 10:14:31,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:31,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:31,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863255974] [2021-03-26 10:14:31,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:31,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:31,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:31,385 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2021-03-26 10:14:31,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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-03-26 10:14:31,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:31,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2021-03-26 10:14:31,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:31,438 INFO L129 PetriNetUnfolder]: 8/60 cut-off events. [2021-03-26 10:14:31,438 INFO L130 PetriNetUnfolder]: For 343/407 co-relation queries the response was YES. [2021-03-26 10:14:31,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 60 events. 8/60 cut-off events. For 343/407 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 235 event pairs, 0 based on Foata normal form. 52/112 useless extension candidates. Maximal degree in co-relation 244. Up to 18 conditions per place. [2021-03-26 10:14:31,438 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 2 selfloop transitions, 9 changer transitions 5/36 dead transitions. [2021-03-26 10:14:31,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 36 transitions, 331 flow [2021-03-26 10:14:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 820 transitions. [2021-03-26 10:14:31,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8078817733990148 [2021-03-26 10:14:31,441 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 820 transitions. [2021-03-26 10:14:31,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 820 transitions. [2021-03-26 10:14:31,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:31,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 820 transitions. [2021-03-26 10:14:31,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 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-03-26 10:14:31,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 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-03-26 10:14:31,446 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 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-03-26 10:14:31,446 INFO L185 Difference]: Start difference. First operand has 52 places, 36 transitions, 326 flow. Second operand 7 states and 820 transitions. [2021-03-26 10:14:31,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 36 transitions, 331 flow [2021-03-26 10:14:31,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 36 transitions, 289 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:31,449 INFO L241 Difference]: Finished difference. Result has 58 places, 31 transitions, 253 flow [2021-03-26 10:14:31,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=58, PETRI_TRANSITIONS=31} [2021-03-26 10:14:31,449 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2021-03-26 10:14:31,449 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:31,449 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 31 transitions, 253 flow [2021-03-26 10:14:31,449 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 31 transitions, 253 flow [2021-03-26 10:14:31,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 31 transitions, 253 flow [2021-03-26 10:14:31,455 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2021-03-26 10:14:31,455 INFO L130 PetriNetUnfolder]: For 162/170 co-relation queries the response was YES. [2021-03-26 10:14:31,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 43 events. 5/43 cut-off events. For 162/170 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 163. Up to 13 conditions per place. [2021-03-26 10:14:31,455 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-26 10:14:31,781 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:14:31,947 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:14:32,619 WARN L205 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 189 [2021-03-26 10:14:32,860 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:14:34,293 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 343 DAG size of output: 271 [2021-03-26 10:14:34,873 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-26 10:14:34,878 INFO L154 LiptonReduction]: Checked pairs total: 181 [2021-03-26 10:14:34,879 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:14:34,879 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3430 [2021-03-26 10:14:34,879 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 27 transitions, 233 flow [2021-03-26 10:14:34,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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-03-26 10:14:34,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:34,880 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:34,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:14:34,880 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:34,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:34,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1811966741, now seen corresponding path program 1 times [2021-03-26 10:14:34,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:34,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953876888] [2021-03-26 10:14:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:34,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:34,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:34,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:34,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:34,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:34,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:34,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:34,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:14:34,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:34,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:14:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:34,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953876888] [2021-03-26 10:14:34,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:34,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:14:34,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757017561] [2021-03-26 10:14:34,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:14:34,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:14:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:14:34,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 147 [2021-03-26 10:14:34,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 27 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 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-03-26 10:14:34,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:34,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 147 [2021-03-26 10:14:34,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:35,048 INFO L129 PetriNetUnfolder]: 11/50 cut-off events. [2021-03-26 10:14:35,049 INFO L130 PetriNetUnfolder]: For 311/313 co-relation queries the response was YES. [2021-03-26 10:14:35,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 50 events. 11/50 cut-off events. For 311/313 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 3/53 useless extension candidates. Maximal degree in co-relation 223. Up to 15 conditions per place. [2021-03-26 10:14:35,049 INFO L132 encePairwiseOnDemand]: 140/147 looper letters, 7 selfloop transitions, 3 changer transitions 17/34 dead transitions. [2021-03-26 10:14:35,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 34 transitions, 339 flow [2021-03-26 10:14:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2021-03-26 10:14:35,052 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6841593780369291 [2021-03-26 10:14:35,052 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2021-03-26 10:14:35,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2021-03-26 10:14:35,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:35,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2021-03-26 10:14:35,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 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-03-26 10:14:35,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 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-03-26 10:14:35,056 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 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-03-26 10:14:35,056 INFO L185 Difference]: Start difference. First operand has 55 places, 27 transitions, 233 flow. Second operand 7 states and 704 transitions. [2021-03-26 10:14:35,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 34 transitions, 339 flow [2021-03-26 10:14:35,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 34 transitions, 285 flow, removed 9 selfloop flow, removed 11 redundant places. [2021-03-26 10:14:35,058 INFO L241 Difference]: Finished difference. Result has 48 places, 17 transitions, 109 flow [2021-03-26 10:14:35,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=48, PETRI_TRANSITIONS=17} [2021-03-26 10:14:35,058 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2021-03-26 10:14:35,058 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:35,058 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 17 transitions, 109 flow [2021-03-26 10:14:35,059 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 17 transitions, 109 flow [2021-03-26 10:14:35,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 17 transitions, 109 flow [2021-03-26 10:14:35,062 INFO L129 PetriNetUnfolder]: 2/22 cut-off events. [2021-03-26 10:14:35,062 INFO L130 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2021-03-26 10:14:35,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 22 events. 2/22 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 66. Up to 6 conditions per place. [2021-03-26 10:14:35,062 INFO L142 LiptonReduction]: Number of co-enabled transitions 4 [2021-03-26 10:14:35,413 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2021-03-26 10:14:35,876 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2021-03-26 10:14:36,033 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 10:14:36,035 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:14:36,035 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:36,035 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 977 [2021-03-26 10:14:36,035 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 15 transitions, 110 flow [2021-03-26 10:14:36,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 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-03-26 10:14:36,036 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:36,036 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:36,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:14:36,036 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1224533860, now seen corresponding path program 1 times [2021-03-26 10:14:36,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:36,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081247488] [2021-03-26 10:14:36,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:36,059 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:36,080 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:36,102 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:14:36,103 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:14:36,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:14:36,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:14:36 BasicIcfg [2021-03-26 10:14:36,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:14:36,147 INFO L168 Benchmark]: Toolchain (without parser) took 23481.76 ms. Allocated memory was 255.9 MB in the beginning and 654.3 MB in the end (delta: 398.5 MB). Free memory was 234.2 MB in the beginning and 496.3 MB in the end (delta: -262.1 MB). Peak memory consumption was 135.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:36,147 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 178.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:14:36,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.82 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.6 MB in the beginning and 323.5 MB in the end (delta: -89.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:36,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.18 ms. Allocated memory is still 362.8 MB. Free memory was 323.5 MB in the beginning and 320.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:36,148 INFO L168 Benchmark]: Boogie Preprocessor took 56.10 ms. Allocated memory is still 362.8 MB. Free memory was 320.6 MB in the beginning and 318.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:36,148 INFO L168 Benchmark]: RCFGBuilder took 1559.61 ms. Allocated memory is still 362.8 MB. Free memory was 318.6 MB in the beginning and 334.9 MB in the end (delta: -16.2 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:36,148 INFO L168 Benchmark]: TraceAbstraction took 21211.05 ms. Allocated memory was 362.8 MB in the beginning and 654.3 MB in the end (delta: 291.5 MB). Free memory was 333.8 MB in the beginning and 496.3 MB in the end (delta: -162.5 MB). Peak memory consumption was 128.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:36,149 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.57 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 178.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 571.82 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.6 MB in the beginning and 323.5 MB in the end (delta: -89.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.18 ms. Allocated memory is still 362.8 MB. Free memory was 323.5 MB in the beginning and 320.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.10 ms. Allocated memory is still 362.8 MB. Free memory was 320.6 MB in the beginning and 318.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1559.61 ms. Allocated memory is still 362.8 MB. Free memory was 318.6 MB in the beginning and 334.9 MB in the end (delta: -16.2 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21211.05 ms. Allocated memory was 362.8 MB in the beginning and 654.3 MB in the end (delta: 291.5 MB). Free memory was 333.8 MB in the beginning and 496.3 MB in the end (delta: -162.5 MB). Peak memory consumption was 128.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8713.8ms, 83 PlacesBefore, 36 PlacesAfterwards, 78 TransitionsBefore, 30 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1544 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 817, positive: 762, positive conditional: 762, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 817, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 817, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 598, positive: 570, positive conditional: 0, positive unconditional: 570, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 598, positive: 567, positive conditional: 0, positive unconditional: 567, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 480, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 466, negative conditional: 0, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 817, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 598, unknown conditional: 0, unknown unconditional: 598] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 570, Positive conditional cache size: 0, Positive unconditional cache size: 570, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3491.3ms, 34 PlacesBefore, 23 PlacesAfterwards, 23 TransitionsBefore, 16 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 536 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, positive: 194, positive conditional: 194, positive unconditional: 0, negative: 62, negative conditional: 62, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 256, positive: 194, positive conditional: 24, positive unconditional: 170, negative: 62, negative conditional: 20, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 194, positive conditional: 24, positive unconditional: 170, negative: 62, negative conditional: 20, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 45, positive conditional: 2, positive unconditional: 43, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 19, negative conditional: 7, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 503, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 497, negative conditional: 200, negative unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 149, positive conditional: 22, positive unconditional: 127, negative: 43, negative conditional: 13, negative unconditional: 30, unknown: 64, unknown conditional: 9, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 615, Positive conditional cache size: 2, Positive unconditional cache size: 613, Negative cache size: 47, Negative conditional cache size: 7, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 886.8ms, 26 PlacesBefore, 25 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, positive: 54, positive conditional: 4, positive unconditional: 50, negative: 18, negative conditional: 6, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 54, positive conditional: 4, positive unconditional: 50, negative: 18, negative conditional: 6, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 111, negative conditional: 73, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 52, positive conditional: 4, positive unconditional: 48, negative: 14, negative conditional: 4, negative unconditional: 10, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 617, Positive conditional cache size: 2, Positive unconditional cache size: 615, Negative cache size: 51, Negative conditional cache size: 9, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4ms, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 115 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 48, positive conditional: 9, positive unconditional: 39, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 48, positive conditional: 9, positive unconditional: 39, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 48, positive conditional: 9, positive unconditional: 39, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 617, Positive conditional cache size: 2, Positive unconditional cache size: 615, Negative cache size: 51, Negative conditional cache size: 9, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 801.7ms, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 224 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, positive: 100, positive conditional: 36, positive unconditional: 64, negative: 23, negative conditional: 2, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 100, positive conditional: 36, positive unconditional: 64, negative: 23, negative conditional: 2, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 68, negative conditional: 16, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, positive: 99, positive conditional: 36, positive unconditional: 63, negative: 20, negative conditional: 1, negative unconditional: 19, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 142 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 62, positive conditional: 16, positive unconditional: 46, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 62, positive conditional: 16, positive unconditional: 46, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 62, positive conditional: 16, positive unconditional: 46, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 205 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, positive: 70, positive conditional: 21, positive unconditional: 49, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 70, positive conditional: 21, positive unconditional: 49, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 70, positive conditional: 21, positive unconditional: 49, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8ms, 43 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 287 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, positive: 149, positive conditional: 149, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, positive: 149, positive conditional: 63, positive unconditional: 86, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, positive: 149, positive conditional: 63, positive unconditional: 86, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 170, positive: 149, positive conditional: 63, positive unconditional: 86, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.2ms, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 387 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, positive: 186, positive conditional: 186, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, positive: 186, positive conditional: 84, positive unconditional: 102, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, positive: 186, positive conditional: 84, positive unconditional: 102, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, positive: 186, positive conditional: 84, positive unconditional: 102, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, positive: 221, positive conditional: 221, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, positive: 221, positive conditional: 101, positive unconditional: 120, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 221, positive conditional: 101, positive unconditional: 120, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, positive: 221, positive conditional: 101, positive unconditional: 120, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 618, Positive conditional cache size: 2, Positive unconditional cache size: 616, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, positive: 40, positive conditional: 12, positive unconditional: 28, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 40, positive conditional: 12, positive unconditional: 28, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 38, positive conditional: 12, positive unconditional: 26, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 620, Positive conditional cache size: 2, Positive unconditional cache size: 618, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3429.5ms, 58 PlacesBefore, 55 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 181 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, positive: 106, positive conditional: 106, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, positive: 106, positive conditional: 75, positive unconditional: 31, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 106, positive conditional: 75, positive unconditional: 31, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, positive: 96, positive conditional: 65, positive unconditional: 31, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 630, Positive conditional cache size: 12, Positive unconditional cache size: 618, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 976.0ms, 48 PlacesBefore, 37 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 630, Positive conditional cache size: 12, Positive unconditional cache size: 618, Negative cache size: 54, Negative conditional cache size: 10, Negative unconditional cache size: 44, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1455; [L793] FCALL, FORK 0 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1456; [L795] FCALL, FORK 0 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21084.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1042.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8781.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 38 SDslu, 19 SDs, 0 SdLazy, 273 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 377.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 382.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=9, InterpolantAutomatonStates: 59, 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: 59.5ms SsaConstructionTime, 350.0ms SatisfiabilityAnalysisTime, 870.7ms InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...