/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/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:31:00,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:31:00,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:31:00,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:31:00,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:31:00,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:31:00,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:31:00,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:31:00,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:31:00,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:31:00,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:31:00,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:31:00,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:31:00,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:31:00,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:31:00,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:31:00,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:31:00,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:31:00,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:31:00,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:31:00,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:31:00,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:31:00,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:31:00,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:31:00,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:31:00,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:31:00,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:31:00,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:31:00,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:31:00,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:31:00,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:31:00,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:31:00,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:31:00,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:31:00,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:31:00,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:31:00,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:31:00,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:31:00,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:31:00,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:31:00,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:31:00,479 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:31:00,507 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:31:00,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:31:00,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:31:00,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:31:00,510 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:31:00,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:31:00,510 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:31:00,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:31:00,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:31:00,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:31:00,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:31:00,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:31:00,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:31:00,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:31:00,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:31:00,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:31:00,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:31:00,513 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:31:00,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:31:00,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:31:00,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:31:00,776 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:31:00,776 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:31:00,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-03-26 10:31:00,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4f97743/a7b3bf81603747dd8fb478f0a54d2551/FLAG3c5705cbf [2021-03-26 10:31:01,296 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:31:01,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2021-03-26 10:31:01,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4f97743/a7b3bf81603747dd8fb478f0a54d2551/FLAG3c5705cbf [2021-03-26 10:31:01,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4f97743/a7b3bf81603747dd8fb478f0a54d2551 [2021-03-26 10:31:01,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:31:01,327 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:31:01,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:31:01,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:31:01,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:31:01,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfcb637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01, skipping insertion in model container [2021-03-26 10:31:01,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:31:01,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:31:01,504 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/safe010_power.oepc.i[952,965] [2021-03-26 10:31:01,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:31:01,646 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:31:01,656 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/safe010_power.oepc.i[952,965] [2021-03-26 10:31:01,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:31:01,766 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:31:01,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01 WrapperNode [2021-03-26 10:31:01,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:31:01,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:31:01,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:31:01,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:31:01,774 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:31:01" (1/1) ... [2021-03-26 10:31:01,803 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:31:01" (1/1) ... [2021-03-26 10:31:01,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:31:01,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:31:01,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:31:01,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:31:01,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (1/1) ... [2021-03-26 10:31:01,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:31:01,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:31:01,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:31:01,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:31:01,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (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:31:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:31:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:31:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:31:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:31:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:31:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:31:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:31:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:31:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:31:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:31:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:31:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:31:01,935 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:31:03,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:31:03,184 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:31:03,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:31:03 BoogieIcfgContainer [2021-03-26 10:31:03,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:31:03,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:31:03,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:31:03,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:31:03,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:31:01" (1/3) ... [2021-03-26 10:31:03,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5ed885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:31:03, skipping insertion in model container [2021-03-26 10:31:03,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:01" (2/3) ... [2021-03-26 10:31:03,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5ed885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:31:03, skipping insertion in model container [2021-03-26 10:31:03,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:31:03" (3/3) ... [2021-03-26 10:31:03,190 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2021-03-26 10:31:03,194 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:31:03,197 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:31:03,198 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:31:03,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,227 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:03,229 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:31:03,241 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:31:03,254 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:31:03,254 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:31:03,254 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:31:03,254 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:31:03,254 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:31:03,254 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:31:03,254 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:31:03,254 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:31:03,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 10:31:03,281 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 10:31:03,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:03,284 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 3. Compared 45 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:31:03,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-26 10:31:03,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-26 10:31:03,287 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:03,296 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 10:31:03,298 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-26 10:31:03,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-26 10:31:03,309 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-26 10:31:03,309 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:03,309 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 3. Compared 47 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:31:03,311 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-26 10:31:04,115 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 10:31:04,376 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 10:31:05,458 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 10:31:05,903 WARN L205 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 10:31:06,662 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:31:07,092 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:31:08,426 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 10:31:08,723 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 10:31:09,306 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:31:09,868 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:31:09,876 INFO L154 LiptonReduction]: Checked pairs total: 1464 [2021-03-26 10:31:09,877 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-26 10:31:09,878 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6591 [2021-03-26 10:31:09,884 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-26 10:31:09,884 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:09,884 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:09,884 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:09,884 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1967679308, now seen corresponding path program 1 times [2021-03-26 10:31:09,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:09,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212353541] [2021-03-26 10:31:09,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:10,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:10,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:10,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:10,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:10,043 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:31:10,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212353541] [2021-03-26 10:31:10,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:10,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:31:10,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206445568] [2021-03-26 10:31:10,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:31:10,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:31:10,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:31:10,061 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-03-26 10:31:10,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 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:31:10,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:10,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-03-26 10:31:10,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:10,123 INFO L129 PetriNetUnfolder]: 23/92 cut-off events. [2021-03-26 10:31:10,123 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:10,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 92 events. 23/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 16 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 133. Up to 37 conditions per place. [2021-03-26 10:31:10,126 INFO L132 encePairwiseOnDemand]: 133/137 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-26 10:31:10,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-26 10:31:10,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:31:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:31:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-26 10:31:10,139 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2021-03-26 10:31:10,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-26 10:31:10,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-26 10:31:10,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:10,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-26 10:31:10,145 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:31:10,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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:31:10,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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:31:10,150 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 356 transitions. [2021-03-26 10:31:10,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-26 10:31:10,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:31:10,152 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-26 10:31:10,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 10:31:10,154 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-26 10:31:10,154 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:10,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-26 10:31:10,155 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-26 10:31:10,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-26 10:31:10,157 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:31:10,157 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:10,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:31:10,158 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:31:10,558 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-03-26 10:31:10,922 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:31:11,197 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:31:11,785 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:31:12,416 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:31:12,582 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-26 10:31:12,582 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:31:12,583 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2429 [2021-03-26 10:31:12,583 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-26 10:31:12,584 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:31:12,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:12,584 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:12,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:31:12,584 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash 434742666, now seen corresponding path program 1 times [2021-03-26 10:31:12,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:12,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218791621] [2021-03-26 10:31:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:12,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:12,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:12,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:12,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:12,648 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:31:12,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:31:12,652 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:31:12,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218791621] [2021-03-26 10:31:12,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:12,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:31:12,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018320295] [2021-03-26 10:31:12,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:31:12,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:31:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:31:12,654 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 142 [2021-03-26 10:31:12,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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:31:12,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:12,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 142 [2021-03-26 10:31:12,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:12,664 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 10:31:12,664 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:12,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:31:12,665 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 1 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2021-03-26 10:31:12,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 48 flow [2021-03-26 10:31:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:31:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:31:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2021-03-26 10:31:12,667 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8474178403755869 [2021-03-26 10:31:12,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2021-03-26 10:31:12,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2021-03-26 10:31:12,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:12,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2021-03-26 10:31:12,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:31:12,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:31:12,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:31:12,669 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 361 transitions. [2021-03-26 10:31:12,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 48 flow [2021-03-26 10:31:12,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 44 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:31:12,670 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 46 flow [2021-03-26 10:31:12,670 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2021-03-26 10:31:12,670 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-26 10:31:12,671 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:12,671 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-26 10:31:12,671 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-26 10:31:12,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2021-03-26 10:31:12,673 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 10:31:12,673 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:12,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 17 events. 0/17 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/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:31:12,673 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-26 10:31:13,249 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 10:31:13,362 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:31:13,600 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-26 10:31:13,704 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:31:13,706 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-26 10:31:13,706 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:31:13,707 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1036 [2021-03-26 10:31:13,707 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-26 10:31:13,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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:31:13,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:13,708 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:13,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:31:13,708 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash 942494911, now seen corresponding path program 1 times [2021-03-26 10:31:13,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:13,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640968604] [2021-03-26 10:31:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:13,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:13,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:13,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:13,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:31:13,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:13,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:31:13,761 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:31:13,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640968604] [2021-03-26 10:31:13,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:13,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:31:13,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873855303] [2021-03-26 10:31:13,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:31:13,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:13,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:31:13,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:31:13,763 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2021-03-26 10:31:13,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:31:13,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:13,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2021-03-26 10:31:13,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:13,782 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:31:13,783 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-26 10:31:13,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:31:13,783 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2021-03-26 10:31:13,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2021-03-26 10:31:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:31:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:31:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2021-03-26 10:31:13,785 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2021-03-26 10:31:13,785 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2021-03-26 10:31:13,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2021-03-26 10:31:13,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:13,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2021-03-26 10:31:13,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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:31:13,788 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:31:13,788 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:31:13,788 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 475 transitions. [2021-03-26 10:31:13,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2021-03-26 10:31:13,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:31:13,789 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2021-03-26 10:31:13,789 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2021-03-26 10:31:13,789 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -9 predicate places. [2021-03-26 10:31:13,789 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:13,790 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-26 10:31:13,790 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-26 10:31:13,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2021-03-26 10:31:13,792 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 10:31:13,792 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:31:13,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:31:13,792 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-26 10:31:14,073 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-26 10:31:14,073 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:31:14,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 284 [2021-03-26 10:31:14,074 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow [2021-03-26 10:31:14,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:31:14,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:14,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:14,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:31:14,075 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1529641860, now seen corresponding path program 1 times [2021-03-26 10:31:14,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:14,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457593786] [2021-03-26 10:31:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:14,219 INFO L142 QuantifierPusher]: treesize reduction 40, result has 25.9 percent of original size [2021-03-26 10:31:14,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:31:14,234 INFO L142 QuantifierPusher]: treesize reduction 55, result has 21.4 percent of original size [2021-03-26 10:31:14,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:31:14,245 INFO L142 QuantifierPusher]: treesize reduction 16, result has 72.4 percent of original size [2021-03-26 10:31:14,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:31:14,269 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:31:14,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457593786] [2021-03-26 10:31:14,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:14,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:31:14,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977999889] [2021-03-26 10:31:14,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:31:14,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:14,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:31:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:31:14,273 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2021-03-26 10:31:14,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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:31:14,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:14,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2021-03-26 10:31:14,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:14,320 INFO L129 PetriNetUnfolder]: 13/43 cut-off events. [2021-03-26 10:31:14,320 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-03-26 10:31:14,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 43 events. 13/43 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 2 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 95. Up to 24 conditions per place. [2021-03-26 10:31:14,321 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 8 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2021-03-26 10:31:14,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 84 flow [2021-03-26 10:31:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:31:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:31:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2021-03-26 10:31:14,323 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.753448275862069 [2021-03-26 10:31:14,323 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2021-03-26 10:31:14,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2021-03-26 10:31:14,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:14,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2021-03-26 10:31:14,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:31:14,325 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:31:14,325 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:31:14,326 INFO L185 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 4 states and 437 transitions. [2021-03-26 10:31:14,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 84 flow [2021-03-26 10:31:14,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 19 transitions, 72 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:31:14,327 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 59 flow [2021-03-26 10:31:14,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-03-26 10:31:14,327 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-26 10:31:14,327 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:14,327 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-26 10:31:14,327 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-26 10:31:14,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 59 flow [2021-03-26 10:31:14,331 INFO L129 PetriNetUnfolder]: 3/21 cut-off events. [2021-03-26 10:31:14,331 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 10:31:14,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 21 events. 3/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 1 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-26 10:31:14,332 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-26 10:31:14,386 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-26 10:31:14,386 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:31:14,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 10:31:14,387 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 59 flow [2021-03-26 10:31:14,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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:31:14,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:14,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:14,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:31:14,388 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:14,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2037445189, now seen corresponding path program 1 times [2021-03-26 10:31:14,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:14,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187212808] [2021-03-26 10:31:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:14,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:14,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:14,469 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:31:14,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:31:14,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:14,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:14,475 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:31:14,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187212808] [2021-03-26 10:31:14,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:14,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:31:14,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100232036] [2021-03-26 10:31:14,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:31:14,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:31:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:31:14,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 145 [2021-03-26 10:31:14,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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:31:14,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:14,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 145 [2021-03-26 10:31:14,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:14,500 INFO L129 PetriNetUnfolder]: 10/42 cut-off events. [2021-03-26 10:31:14,500 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:31:14,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 42 events. 10/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 114 event pairs, 4 based on Foata normal form. 5/45 useless extension candidates. Maximal degree in co-relation 87. Up to 19 conditions per place. [2021-03-26 10:31:14,501 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 4 selfloop transitions, 5 changer transitions 3/23 dead transitions. [2021-03-26 10:31:14,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 97 flow [2021-03-26 10:31:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:31:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:31:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2021-03-26 10:31:14,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8055172413793104 [2021-03-26 10:31:14,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2021-03-26 10:31:14,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2021-03-26 10:31:14,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:14,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2021-03-26 10:31:14,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 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:31:14,505 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:31:14,505 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:31:14,506 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 59 flow. Second operand 5 states and 584 transitions. [2021-03-26 10:31:14,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 97 flow [2021-03-26 10:31:14,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:31:14,506 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 91 flow [2021-03-26 10:31:14,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2021-03-26 10:31:14,507 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2021-03-26 10:31:14,507 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:14,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 91 flow [2021-03-26 10:31:14,507 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 91 flow [2021-03-26 10:31:14,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 91 flow [2021-03-26 10:31:14,512 INFO L129 PetriNetUnfolder]: 7/38 cut-off events. [2021-03-26 10:31:14,512 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-03-26 10:31:14,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 38 events. 7/38 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 3 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 91. Up to 13 conditions per place. [2021-03-26 10:31:14,513 INFO L142 LiptonReduction]: Number of co-enabled transitions 66 [2021-03-26 10:31:14,527 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-26 10:31:14,527 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:31:14,527 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:31:14,528 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 91 flow [2021-03-26 10:31:14,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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:31:14,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:14,528 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:14,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:31:14,528 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1540542662, now seen corresponding path program 1 times [2021-03-26 10:31:14,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:14,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193759686] [2021-03-26 10:31:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:14,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:14,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:14,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:14,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:14,609 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:31:14,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:31:14,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:14,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:14,617 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:31:14,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193759686] [2021-03-26 10:31:14,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:14,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:31:14,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753989321] [2021-03-26 10:31:14,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:31:14,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:31:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:31:14,622 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 145 [2021-03-26 10:31:14,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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:31:14,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:14,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 145 [2021-03-26 10:31:14,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:14,658 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 10:31:14,662 INFO L130 PetriNetUnfolder]: For 30/40 co-relation queries the response was YES. [2021-03-26 10:31:14,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 28 events. 3/28 cut-off events. For 30/40 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 14/42 useless extension candidates. Maximal degree in co-relation 79. Up to 12 conditions per place. [2021-03-26 10:31:14,663 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 2 selfloop transitions, 8 changer transitions 2/23 dead transitions. [2021-03-26 10:31:14,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 129 flow [2021-03-26 10:31:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:31:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:31:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2021-03-26 10:31:14,665 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-26 10:31:14,665 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2021-03-26 10:31:14,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2021-03-26 10:31:14,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:14,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2021-03-26 10:31:14,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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:31:14,668 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:31:14,668 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:31:14,668 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 91 flow. Second operand 7 states and 812 transitions. [2021-03-26 10:31:14,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 129 flow [2021-03-26 10:31:14,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 23 transitions, 123 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:31:14,670 INFO L241 Difference]: Finished difference. Result has 38 places, 21 transitions, 118 flow [2021-03-26 10:31:14,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2021-03-26 10:31:14,671 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2021-03-26 10:31:14,671 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:14,671 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 118 flow [2021-03-26 10:31:14,671 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 118 flow [2021-03-26 10:31:14,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 118 flow [2021-03-26 10:31:14,676 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-03-26 10:31:14,676 INFO L130 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2021-03-26 10:31:14,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 25 events. 2/25 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2021-03-26 10:31:14,678 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-26 10:31:14,925 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:31:15,041 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:31:15,681 WARN L205 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 189 [2021-03-26 10:31:15,891 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:31:17,251 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 344 DAG size of output: 265 [2021-03-26 10:31:17,726 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:31:17,729 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-26 10:31:17,729 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:31:17,729 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3058 [2021-03-26 10:31:17,729 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 16 transitions, 96 flow [2021-03-26 10:31:17,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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:31:17,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:17,730 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:17,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:31:17,730 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1404694880, now seen corresponding path program 1 times [2021-03-26 10:31:17,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:17,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867236420] [2021-03-26 10:31:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:17,792 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-26 10:31:17,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 10:31:17,833 INFO L142 QuantifierPusher]: treesize reduction 16, result has 83.7 percent of original size [2021-03-26 10:31:17,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 82 [2021-03-26 10:31:17,873 INFO L142 QuantifierPusher]: treesize reduction 12, result has 85.2 percent of original size [2021-03-26 10:31:17,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-03-26 10:31:17,910 INFO L142 QuantifierPusher]: treesize reduction 16, result has 81.8 percent of original size [2021-03-26 10:31:17,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:31:17,951 INFO L142 QuantifierPusher]: treesize reduction 28, result has 68.2 percent of original size [2021-03-26 10:31:17,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-26 10:31:17,991 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-03-26 10:31:17,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:31:18,003 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:31:18,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867236420] [2021-03-26 10:31:18,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:18,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:31:18,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027983527] [2021-03-26 10:31:18,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:31:18,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:31:18,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:31:18,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 148 [2021-03-26 10:31:18,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 16 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 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:31:18,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:18,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 148 [2021-03-26 10:31:18,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:18,120 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2021-03-26 10:31:18,120 INFO L130 PetriNetUnfolder]: For 101/105 co-relation queries the response was YES. [2021-03-26 10:31:18,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 23 events. 3/23 cut-off events. For 101/105 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 5/28 useless extension candidates. Maximal degree in co-relation 76. Up to 9 conditions per place. [2021-03-26 10:31:18,121 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 4 selfloop transitions, 4 changer transitions 2/17 dead transitions. [2021-03-26 10:31:18,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 17 transitions, 114 flow [2021-03-26 10:31:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:31:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:31:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2021-03-26 10:31:18,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6988416988416989 [2021-03-26 10:31:18,123 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2021-03-26 10:31:18,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2021-03-26 10:31:18,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:18,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2021-03-26 10:31:18,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 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:31:18,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 148.0) internal successors, (1184), 8 states have internal predecessors, (1184), 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:31:18,126 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 148.0) internal successors, (1184), 8 states have internal predecessors, (1184), 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:31:18,126 INFO L185 Difference]: Start difference. First operand has 34 places, 16 transitions, 96 flow. Second operand 7 states and 724 transitions. [2021-03-26 10:31:18,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 17 transitions, 114 flow [2021-03-26 10:31:18,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 17 transitions, 91 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 10:31:18,127 INFO L241 Difference]: Finished difference. Result has 32 places, 15 transitions, 80 flow [2021-03-26 10:31:18,127 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2021-03-26 10:31:18,127 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-03-26 10:31:18,127 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:18,127 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 15 transitions, 80 flow [2021-03-26 10:31:18,128 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 15 transitions, 80 flow [2021-03-26 10:31:18,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 15 transitions, 80 flow [2021-03-26 10:31:18,130 INFO L129 PetriNetUnfolder]: 2/18 cut-off events. [2021-03-26 10:31:18,130 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 10:31:18,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 18 events. 2/18 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 46. Up to 6 conditions per place. [2021-03-26 10:31:18,131 INFO L142 LiptonReduction]: Number of co-enabled transitions 16 [2021-03-26 10:31:18,306 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:31:18,703 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-26 10:31:18,817 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:31:18,818 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:31:18,818 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:31:18,818 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 691 [2021-03-26 10:31:18,819 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 15 transitions, 83 flow [2021-03-26 10:31:18,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 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:31:18,819 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:18,819 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:18,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:31:18,820 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash 433911784, now seen corresponding path program 1 times [2021-03-26 10:31:18,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:18,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775379846] [2021-03-26 10:31:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:31:18,854 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:31:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:31:18,872 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:31:18,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:31:18,896 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:31:18,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:31:18,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:31:18 BasicIcfg [2021-03-26 10:31:18,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:31:18,956 INFO L168 Benchmark]: Toolchain (without parser) took 17628.90 ms. Allocated memory was 255.9 MB in the beginning and 736.1 MB in the end (delta: 480.2 MB). Free memory was 231.9 MB in the beginning and 638.2 MB in the end (delta: -406.3 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:31:18,956 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:31:18,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.14 ms. Allocated memory was 255.9 MB in the beginning and 373.3 MB in the end (delta: 117.4 MB). Free memory was 231.9 MB in the beginning and 333.8 MB in the end (delta: -101.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:31:18,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.38 ms. Allocated memory is still 373.3 MB. Free memory was 333.8 MB in the beginning and 331.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:31:18,957 INFO L168 Benchmark]: Boogie Preprocessor took 25.65 ms. Allocated memory is still 373.3 MB. Free memory was 331.2 MB in the beginning and 329.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:31:18,957 INFO L168 Benchmark]: RCFGBuilder took 1328.17 ms. Allocated memory is still 373.3 MB. Free memory was 328.6 MB in the beginning and 296.9 MB in the end (delta: 31.7 MB). Peak memory consumption was 47.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:31:18,957 INFO L168 Benchmark]: TraceAbstraction took 15769.05 ms. Allocated memory was 373.3 MB in the beginning and 736.1 MB in the end (delta: 362.8 MB). Free memory was 296.9 MB in the beginning and 638.2 MB in the end (delta: -341.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:31:18,958 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 439.14 ms. Allocated memory was 255.9 MB in the beginning and 373.3 MB in the end (delta: 117.4 MB). Free memory was 231.9 MB in the beginning and 333.8 MB in the end (delta: -101.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.38 ms. Allocated memory is still 373.3 MB. Free memory was 333.8 MB in the beginning and 331.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 25.65 ms. Allocated memory is still 373.3 MB. Free memory was 331.2 MB in the beginning and 329.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1328.17 ms. Allocated memory is still 373.3 MB. Free memory was 328.6 MB in the beginning and 296.9 MB in the end (delta: 31.7 MB). Peak memory consumption was 47.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15769.05 ms. Allocated memory was 373.3 MB in the beginning and 736.1 MB in the end (delta: 362.8 MB). Free memory was 296.9 MB in the beginning and 638.2 MB in the end (delta: -341.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6579.1ms, 83 PlacesBefore, 35 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1464 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 774, positive: 727, positive conditional: 727, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 774, positive: 727, positive conditional: 0, positive unconditional: 727, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 774, positive: 727, positive conditional: 0, positive unconditional: 727, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 604, positive: 581, positive conditional: 0, positive unconditional: 581, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 604, positive: 577, positive conditional: 0, positive unconditional: 577, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 285, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 272, negative conditional: 0, negative unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 774, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 604, unknown conditional: 0, unknown unconditional: 604] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 581, Positive conditional cache size: 0, Positive unconditional cache size: 581, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2427.9ms, 33 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, positive: 97, positive conditional: 97, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, positive: 97, positive conditional: 16, positive unconditional: 81, negative: 46, negative conditional: 7, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 97, positive conditional: 16, positive unconditional: 81, negative: 46, negative conditional: 7, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, positive: 42, positive conditional: 7, positive unconditional: 35, negative: 12, negative conditional: 2, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 54, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 2, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 163, negative conditional: 21, negative unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, positive: 55, positive conditional: 9, positive unconditional: 46, negative: 34, negative conditional: 5, negative unconditional: 29, unknown: 54, unknown conditional: 9, unknown unconditional: 45] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 623, Positive conditional cache size: 7, Positive unconditional cache size: 616, Negative cache size: 35, Negative conditional cache size: 2, Negative unconditional cache size: 33, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1035.5ms, 25 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 636, Positive conditional cache size: 7, Positive unconditional cache size: 629, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 283.3ms, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 188, negative conditional: 0, negative unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 678, Positive cache size: 636, Positive conditional cache size: 7, Positive unconditional cache size: 629, Negative cache size: 42, Negative conditional cache size: 2, Negative unconditional cache size: 40, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.4ms, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 53, negative conditional: 53, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 7, positive conditional: 3, positive unconditional: 4, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 636, Positive conditional cache size: 7, Positive unconditional cache size: 629, Negative cache size: 44, Negative conditional cache size: 4, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.7ms, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 681, Positive cache size: 636, Positive conditional cache size: 7, Positive unconditional cache size: 629, Negative cache size: 45, Negative conditional cache size: 5, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3057.5ms, 38 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 16 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, positive: 17, positive conditional: 14, positive unconditional: 3, negative: 15, negative conditional: 9, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 17, positive conditional: 14, positive unconditional: 3, negative: 15, negative conditional: 9, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 21, negative conditional: 13, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 15, positive conditional: 12, positive unconditional: 3, negative: 13, negative conditional: 8, negative unconditional: 5, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 638, Positive conditional cache size: 9, Positive unconditional cache size: 629, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 690.7ms, 32 PlacesBefore, 30 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 685, Positive cache size: 638, Positive conditional cache size: 9, Positive unconditional cache size: 629, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, 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; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 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 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15645.3ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 400.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6627.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22 SDtfs, 8 SDslu, 12 SDs, 0 SdLazy, 101 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 339.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=6, InterpolantAutomatonStates: 33, 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: 15.8ms SsaConstructionTime, 263.6ms SatisfiabilityAnalysisTime, 597.6ms InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...