/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:58:21,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:58:21,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:58:21,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:58:21,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:58:21,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:58:21,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:58:21,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:58:21,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:58:21,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:58:21,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:58:21,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:58:21,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:58:21,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:58:21,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:58:21,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:58:21,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:58:21,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:58:21,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:58:21,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:58:21,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:58:21,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:58:21,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:58:21,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:58:21,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:58:21,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:58:21,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:58:21,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:58:21,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:58:21,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:58:21,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:58:21,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:58:21,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:58:21,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:58:21,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:58:21,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:58:21,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:58:21,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:58:21,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:58:21,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:58:21,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:58:21,324 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-RepeatedSemanticLbe.epf [2021-06-11 06:58:21,355 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:58:21,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:58:21,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:58:21,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:58:21,358 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:58:21,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:58:21,358 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:58:21,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:58:21,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:58:21,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:58:21,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:58:21,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:58:21,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:58:21,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:58:21,360 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-06-11 06:58:21,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:58:21,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:58:21,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:58:21,612 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:58:21,612 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:58:21,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-06-11 06:58:21,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11229bfd5/12644d0cc38f49949d498aca93963a8b/FLAG5a274f8a0 [2021-06-11 06:58:22,045 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:58:22,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2021-06-11 06:58:22,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11229bfd5/12644d0cc38f49949d498aca93963a8b/FLAG5a274f8a0 [2021-06-11 06:58:22,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11229bfd5/12644d0cc38f49949d498aca93963a8b [2021-06-11 06:58:22,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:58:22,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:58:22,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:58:22,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:58:22,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:58:22,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3069f00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22, skipping insertion in model container [2021-06-11 06:58:22,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:58:22,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:58:22,584 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/safe029_pso.oepc.i[950,963] [2021-06-11 06:58:22,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:58:22,749 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:58:22,758 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/safe029_pso.oepc.i[950,963] [2021-06-11 06:58:22,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:58:22,828 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:58:22,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22 WrapperNode [2021-06-11 06:58:22,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:58:22,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:58:22,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:58:22,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:58:22,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:58:22,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:58:22,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:58:22,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:58:22,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... [2021-06-11 06:58:22,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:58:22,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:58:22,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:58:22,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:58:22,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:58:22,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:58:22,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:58:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:58:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:58:22,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:58:22,929 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:58:24,030 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:58:24,030 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:58:24,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:58:24 BoogieIcfgContainer [2021-06-11 06:58:24,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:58:24,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:58:24,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:58:24,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:58:24,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:58:22" (1/3) ... [2021-06-11 06:58:24,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dddbe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:58:24, skipping insertion in model container [2021-06-11 06:58:24,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:58:22" (2/3) ... [2021-06-11 06:58:24,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dddbe91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:58:24, skipping insertion in model container [2021-06-11 06:58:24,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:58:24" (3/3) ... [2021-06-11 06:58:24,036 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-06-11 06:58:24,040 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:58:24,042 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:58:24,043 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:58:24,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,060 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,071 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:58:24,073 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:58:24,084 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 06:58:24,095 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:58:24,095 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:58:24,095 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:58:24,096 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:58:24,096 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:58:24,096 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:58:24,096 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:58:24,096 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:58:24,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-06-11 06:58:24,120 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-06-11 06:58:24,120 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:24,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 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/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 06:58:24,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-06-11 06:58:24,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:24,126 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:24,133 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:24,135 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:24,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-06-11 06:58:24,145 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-06-11 06:58:24,146 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:24,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 06:58:24,147 INFO L151 LiptonReduction]: Number of co-enabled transitions 926 [2021-06-11 06:58:24,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,507 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:58:24,508 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:24,525 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:24,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:24,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:24,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:24,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:25,462 WARN L205 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-06-11 06:58:25,745 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 06:58:27,034 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-06-11 06:58:27,568 WARN L205 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 06:58:27,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:27,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:27,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:27,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:27,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:27,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:27,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:27,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:27,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,036 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:58:28,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:28,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:28,545 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:58:28,893 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 06:58:29,019 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 06:58:29,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:29,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:58:29,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:29,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,039 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 06:58:29,039 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:29,046 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,048 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 06:58:29,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:29,050 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 06:58:29,050 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 06:58:29,050 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:29,051 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,053 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 06:58:29,054 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 06:58:29,054 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:58:29,055 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,057 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 06:58:29,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:29,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:29,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:29,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:29,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:29,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:58:29,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 06:58:29,762 WARN L205 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-06-11 06:58:30,034 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 06:58:30,659 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 06:58:31,242 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 06:58:31,534 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 06:58:31,810 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-06-11 06:58:32,366 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 06:58:32,915 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-06-11 06:58:32,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:32,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:32,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:32,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:33,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:33,061 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:58:33,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:33,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:33,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:33,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:33,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:33,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:33,662 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 06:58:33,938 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-06-11 06:58:35,030 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-06-11 06:58:35,603 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 06:58:35,941 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 06:58:36,258 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 06:58:36,815 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 06:58:37,418 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-11 06:58:37,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:37,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:37,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:37,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:37,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:37,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:37,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:37,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:38,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:38,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:38,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:38,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:38,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:38,252 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-11 06:58:38,355 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-11 06:58:38,588 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-06-11 06:58:38,704 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-06-11 06:58:38,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:38,712 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:58:38,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:38,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:58:38,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:38,724 INFO L163 LiptonReduction]: Checked pairs total: 2570 [2021-06-11 06:58:38,724 INFO L165 LiptonReduction]: Total number of compositions: 74 [2021-06-11 06:58:38,726 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14601 [2021-06-11 06:58:38,733 INFO L129 PetriNetUnfolder]: 0/5 cut-off events. [2021-06-11 06:58:38,733 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:38,733 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:38,734 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 06:58:38,734 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:38,739 INFO L82 PathProgramCache]: Analyzing trace with hash 915118, now seen corresponding path program 1 times [2021-06-11 06:58:38,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:38,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983729693] [2021-06-11 06:58:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:38,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:38,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:38,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983729693] [2021-06-11 06:58:38,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:38,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:58:38,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553863793] [2021-06-11 06:58:38,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:58:38,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:38,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:58:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:58:38,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2021-06-11 06:58:38,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:38,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:38,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2021-06-11 06:58:38,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:38,931 INFO L129 PetriNetUnfolder]: 23/61 cut-off events. [2021-06-11 06:58:38,931 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:38,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 61 events. 23/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 214 event pairs, 16 based on Foata normal form. 6/57 useless extension candidates. Maximal degree in co-relation 107. Up to 37 conditions per place. [2021-06-11 06:58:38,933 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 7 selfloop transitions, 2 changer transitions 3/22 dead transitions. [2021-06-11 06:58:38,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 72 flow [2021-06-11 06:58:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-06-11 06:58:38,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2021-06-11 06:58:38,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-06-11 06:58:38,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-06-11 06:58:38,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:38,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-06-11 06:58:38,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:38,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:38,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:38,952 INFO L185 Difference]: Start difference. First operand has 27 places, 22 transitions, 50 flow. Second operand 3 states and 369 transitions. [2021-06-11 06:58:38,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 72 flow [2021-06-11 06:58:38,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:38,954 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2021-06-11 06:58:38,955 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-06-11 06:58:38,956 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2021-06-11 06:58:38,956 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:38,956 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2021-06-11 06:58:38,956 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 40 flow [2021-06-11 06:58:38,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2021-06-11 06:58:38,959 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 06:58:38,959 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:38,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:58:38,959 INFO L151 LiptonReduction]: Number of co-enabled transitions 112 [2021-06-11 06:58:39,138 INFO L163 LiptonReduction]: Checked pairs total: 120 [2021-06-11 06:58:39,138 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182 [2021-06-11 06:58:39,139 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-06-11 06:58:39,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:58:39,140 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -922098124, now seen corresponding path program 1 times [2021-06-11 06:58:39,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540550627] [2021-06-11 06:58:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:39,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:39,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540550627] [2021-06-11 06:58:39,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:39,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:58:39,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159468522] [2021-06-11 06:58:39,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:58:39,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:39,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:58:39,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:58:39,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 153 [2021-06-11 06:58:39,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:39,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 153 [2021-06-11 06:58:39,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:39,221 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-06-11 06:58:39,221 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:39,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-06-11 06:58:39,221 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 3 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2021-06-11 06:58:39,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 56 flow [2021-06-11 06:58:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2021-06-11 06:58:39,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8191721132897604 [2021-06-11 06:58:39,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2021-06-11 06:58:39,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2021-06-11 06:58:39,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:39,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2021-06-11 06:58:39,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,228 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,228 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 376 transitions. [2021-06-11 06:58:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 56 flow [2021-06-11 06:58:39,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:58:39,231 INFO L241 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:39,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2021-06-11 06:58:39,231 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2021-06-11 06:58:39,231 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:39,232 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:39,232 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:39,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:39,235 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-06-11 06:58:39,235 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:58:39,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 26 events. 3/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2021-06-11 06:58:39,236 INFO L151 LiptonReduction]: Number of co-enabled transitions 118 [2021-06-11 06:58:39,268 INFO L163 LiptonReduction]: Checked pairs total: 102 [2021-06-11 06:58:39,268 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-06-11 06:58:39,269 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-06-11 06:58:39,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:58:39,270 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1478955922, now seen corresponding path program 1 times [2021-06-11 06:58:39,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299749709] [2021-06-11 06:58:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:39,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:58:39,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:39,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:58:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:39,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299749709] [2021-06-11 06:58:39,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:39,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:39,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909569842] [2021-06-11 06:58:39,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:39,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:39,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2021-06-11 06:58:39,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 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-06-11 06:58:39,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:39,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2021-06-11 06:58:39,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:39,477 INFO L129 PetriNetUnfolder]: 119/222 cut-off events. [2021-06-11 06:58:39,477 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-06-11 06:58:39,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 222 events. 119/222 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 858 event pairs, 93 based on Foata normal form. 2/194 useless extension candidates. Maximal degree in co-relation 463. Up to 200 conditions per place. [2021-06-11 06:58:39,479 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 16 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2021-06-11 06:58:39,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 117 flow [2021-06-11 06:58:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:58:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:58:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2021-06-11 06:58:39,480 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6584967320261438 [2021-06-11 06:58:39,480 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2021-06-11 06:58:39,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2021-06-11 06:58:39,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:39,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2021-06-11 06:58:39,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,483 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 4 states and 403 transitions. [2021-06-11 06:58:39,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 117 flow [2021-06-11 06:58:39,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:58:39,484 INFO L241 Difference]: Finished difference. Result has 28 places, 22 transitions, 86 flow [2021-06-11 06:58:39,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2021-06-11 06:58:39,485 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2021-06-11 06:58:39,485 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:39,485 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 86 flow [2021-06-11 06:58:39,485 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 86 flow [2021-06-11 06:58:39,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 86 flow [2021-06-11 06:58:39,490 INFO L129 PetriNetUnfolder]: 9/41 cut-off events. [2021-06-11 06:58:39,490 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-11 06:58:39,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 41 events. 9/41 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 129 event pairs, 5 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 88. Up to 15 conditions per place. [2021-06-11 06:58:39,490 INFO L151 LiptonReduction]: Number of co-enabled transitions 134 [2021-06-11 06:58:39,491 INFO L163 LiptonReduction]: Checked pairs total: 62 [2021-06-11 06:58:39,491 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,491 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-06-11 06:58:39,492 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 86 flow [2021-06-11 06:58:39,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 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-06-11 06:58:39,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,492 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:58:39,493 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1619679665, now seen corresponding path program 1 times [2021-06-11 06:58:39,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490717335] [2021-06-11 06:58:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:39,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:39,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:39,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490717335] [2021-06-11 06:58:39,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:39,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:58:39,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983334497] [2021-06-11 06:58:39,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:58:39,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:39,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:58:39,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:58:39,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 153 [2021-06-11 06:58:39,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:39,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 153 [2021-06-11 06:58:39,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:39,558 INFO L129 PetriNetUnfolder]: 6/43 cut-off events. [2021-06-11 06:58:39,558 INFO L130 PetriNetUnfolder]: For 63/69 co-relation queries the response was YES. [2021-06-11 06:58:39,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 43 events. 6/43 cut-off events. For 63/69 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 149 event pairs, 4 based on Foata normal form. 3/45 useless extension candidates. Maximal degree in co-relation 98. Up to 14 conditions per place. [2021-06-11 06:58:39,558 INFO L132 encePairwiseOnDemand]: 150/153 looper letters, 3 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2021-06-11 06:58:39,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 22 transitions, 98 flow [2021-06-11 06:58:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:58:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:58:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-06-11 06:58:39,560 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8169934640522876 [2021-06-11 06:58:39,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-06-11 06:58:39,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-06-11 06:58:39,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:39,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-06-11 06:58:39,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,562 INFO L185 Difference]: Start difference. First operand has 28 places, 22 transitions, 86 flow. Second operand 3 states and 375 transitions. [2021-06-11 06:58:39,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 22 transitions, 98 flow [2021-06-11 06:58:39,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:58:39,563 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 97 flow [2021-06-11 06:58:39,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-06-11 06:58:39,563 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2021-06-11 06:58:39,563 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:39,564 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 97 flow [2021-06-11 06:58:39,564 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 97 flow [2021-06-11 06:58:39,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 97 flow [2021-06-11 06:58:39,568 INFO L129 PetriNetUnfolder]: 6/43 cut-off events. [2021-06-11 06:58:39,568 INFO L130 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2021-06-11 06:58:39,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 43 events. 6/43 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 145 event pairs, 4 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 98. Up to 14 conditions per place. [2021-06-11 06:58:39,569 INFO L151 LiptonReduction]: Number of co-enabled transitions 134 [2021-06-11 06:58:39,570 INFO L163 LiptonReduction]: Checked pairs total: 62 [2021-06-11 06:58:39,570 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 06:58:39,571 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 97 flow [2021-06-11 06:58:39,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:58:39,571 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1398018308, now seen corresponding path program 1 times [2021-06-11 06:58:39,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415401494] [2021-06-11 06:58:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:39,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 06:58:39,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-11 06:58:39,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:58:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:39,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415401494] [2021-06-11 06:58:39,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:39,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:39,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458639778] [2021-06-11 06:58:39,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:39,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:39,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:39,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:39,651 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 153 [2021-06-11 06:58:39,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:39,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 153 [2021-06-11 06:58:39,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:39,704 INFO L129 PetriNetUnfolder]: 44/123 cut-off events. [2021-06-11 06:58:39,704 INFO L130 PetriNetUnfolder]: For 154/164 co-relation queries the response was YES. [2021-06-11 06:58:39,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 123 events. 44/123 cut-off events. For 154/164 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 510 event pairs, 5 based on Foata normal form. 5/125 useless extension candidates. Maximal degree in co-relation 322. Up to 81 conditions per place. [2021-06-11 06:58:39,705 INFO L132 encePairwiseOnDemand]: 146/153 looper letters, 12 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2021-06-11 06:58:39,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 166 flow [2021-06-11 06:58:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2021-06-11 06:58:39,707 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6901960784313725 [2021-06-11 06:58:39,707 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2021-06-11 06:58:39,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2021-06-11 06:58:39,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:39,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2021-06-11 06:58:39,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,710 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 97 flow. Second operand 5 states and 528 transitions. [2021-06-11 06:58:39,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 166 flow [2021-06-11 06:58:39,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 161 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 06:58:39,711 INFO L241 Difference]: Finished difference. Result has 37 places, 29 transitions, 159 flow [2021-06-11 06:58:39,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2021-06-11 06:58:39,712 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2021-06-11 06:58:39,712 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:39,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 159 flow [2021-06-11 06:58:39,712 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 159 flow [2021-06-11 06:58:39,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 159 flow [2021-06-11 06:58:39,720 INFO L129 PetriNetUnfolder]: 16/86 cut-off events. [2021-06-11 06:58:39,720 INFO L130 PetriNetUnfolder]: For 202/207 co-relation queries the response was YES. [2021-06-11 06:58:39,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 86 events. 16/86 cut-off events. For 202/207 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 391 event pairs, 3 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 260. Up to 26 conditions per place. [2021-06-11 06:58:39,721 INFO L151 LiptonReduction]: Number of co-enabled transitions 164 [2021-06-11 06:58:39,722 INFO L163 LiptonReduction]: Checked pairs total: 36 [2021-06-11 06:58:39,722 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-06-11 06:58:39,723 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 159 flow [2021-06-11 06:58:39,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,723 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:58:39,724 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1373057108, now seen corresponding path program 2 times [2021-06-11 06:58:39,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781410709] [2021-06-11 06:58:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:39,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:58:39,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 06:58:39,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:58:39,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:58:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:39,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781410709] [2021-06-11 06:58:39,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:39,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:58:39,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439255450] [2021-06-11 06:58:39,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:58:39,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:58:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:58:39,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 153 [2021-06-11 06:58:39,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:39,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 153 [2021-06-11 06:58:39,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:39,870 INFO L129 PetriNetUnfolder]: 175/342 cut-off events. [2021-06-11 06:58:39,870 INFO L130 PetriNetUnfolder]: For 581/599 co-relation queries the response was YES. [2021-06-11 06:58:39,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 342 events. 175/342 cut-off events. For 581/599 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1562 event pairs, 40 based on Foata normal form. 16/323 useless extension candidates. Maximal degree in co-relation 1059. Up to 241 conditions per place. [2021-06-11 06:58:39,872 INFO L132 encePairwiseOnDemand]: 147/153 looper letters, 16 selfloop transitions, 11 changer transitions 8/42 dead transitions. [2021-06-11 06:58:39,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 269 flow [2021-06-11 06:58:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2021-06-11 06:58:39,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2021-06-11 06:58:39,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2021-06-11 06:58:39,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2021-06-11 06:58:39,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:39,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2021-06-11 06:58:39,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,876 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,876 INFO L185 Difference]: Start difference. First operand has 37 places, 29 transitions, 159 flow. Second operand 5 states and 495 transitions. [2021-06-11 06:58:39,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 269 flow [2021-06-11 06:58:39,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 265 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-06-11 06:58:39,878 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 195 flow [2021-06-11 06:58:39,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-06-11 06:58:39,879 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2021-06-11 06:58:39,879 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:39,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 195 flow [2021-06-11 06:58:39,879 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 195 flow [2021-06-11 06:58:39,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 195 flow [2021-06-11 06:58:39,886 INFO L129 PetriNetUnfolder]: 17/77 cut-off events. [2021-06-11 06:58:39,886 INFO L130 PetriNetUnfolder]: For 326/333 co-relation queries the response was YES. [2021-06-11 06:58:39,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 77 events. 17/77 cut-off events. For 326/333 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 317 event pairs, 1 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 284. Up to 34 conditions per place. [2021-06-11 06:58:39,887 INFO L151 LiptonReduction]: Number of co-enabled transitions 120 [2021-06-11 06:58:39,889 INFO L163 LiptonReduction]: Checked pairs total: 36 [2021-06-11 06:58:39,889 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 06:58:39,889 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 195 flow [2021-06-11 06:58:39,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,890 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:58:39,890 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1868384965, now seen corresponding path program 1 times [2021-06-11 06:58:39,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356137848] [2021-06-11 06:58:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:39,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:39,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:39,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:39,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:39,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356137848] [2021-06-11 06:58:39,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:39,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:58:39,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093091211] [2021-06-11 06:58:39,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:58:39,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:39,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:58:39,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:58:39,934 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2021-06-11 06:58:39,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:39,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2021-06-11 06:58:39,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:39,961 INFO L129 PetriNetUnfolder]: 22/87 cut-off events. [2021-06-11 06:58:39,961 INFO L130 PetriNetUnfolder]: For 265/279 co-relation queries the response was YES. [2021-06-11 06:58:39,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 87 events. 22/87 cut-off events. For 265/279 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 369 event pairs, 7 based on Foata normal form. 14/97 useless extension candidates. Maximal degree in co-relation 280. Up to 37 conditions per place. [2021-06-11 06:58:39,962 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 4 selfloop transitions, 5 changer transitions 4/32 dead transitions. [2021-06-11 06:58:39,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 207 flow [2021-06-11 06:58:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2021-06-11 06:58:39,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7830065359477124 [2021-06-11 06:58:39,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2021-06-11 06:58:39,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2021-06-11 06:58:39,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:39,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2021-06-11 06:58:39,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,966 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 195 flow. Second operand 5 states and 599 transitions. [2021-06-11 06:58:39,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 207 flow [2021-06-11 06:58:39,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 180 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-06-11 06:58:39,967 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 173 flow [2021-06-11 06:58:39,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-06-11 06:58:39,968 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2021-06-11 06:58:39,968 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:39,968 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 173 flow [2021-06-11 06:58:39,968 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 173 flow [2021-06-11 06:58:39,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 173 flow [2021-06-11 06:58:39,975 INFO L129 PetriNetUnfolder]: 15/82 cut-off events. [2021-06-11 06:58:39,975 INFO L130 PetriNetUnfolder]: For 188/199 co-relation queries the response was YES. [2021-06-11 06:58:39,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 82 events. 15/82 cut-off events. For 188/199 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 376 event pairs, 6 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 272. Up to 30 conditions per place. [2021-06-11 06:58:39,976 INFO L151 LiptonReduction]: Number of co-enabled transitions 98 [2021-06-11 06:58:39,977 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:58:39,977 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:39,977 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 06:58:39,978 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 173 flow [2021-06-11 06:58:39,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:39,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:39,978 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:39,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:58:39,978 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash 30369490, now seen corresponding path program 1 times [2021-06-11 06:58:39,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:39,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946129403] [2021-06-11 06:58:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:40,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:40,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:40,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:40,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:58:40,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:40,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:58:40,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:40,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:40,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946129403] [2021-06-11 06:58:40,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:40,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:58:40,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592912383] [2021-06-11 06:58:40,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:58:40,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:58:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:58:40,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2021-06-11 06:58:40,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:40,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2021-06-11 06:58:40,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:40,051 INFO L129 PetriNetUnfolder]: 9/59 cut-off events. [2021-06-11 06:58:40,051 INFO L130 PetriNetUnfolder]: For 116/145 co-relation queries the response was YES. [2021-06-11 06:58:40,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 59 events. 9/59 cut-off events. For 116/145 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 209 event pairs, 0 based on Foata normal form. 37/96 useless extension candidates. Maximal degree in co-relation 202. Up to 22 conditions per place. [2021-06-11 06:58:40,052 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 2 selfloop transitions, 8 changer transitions 7/31 dead transitions. [2021-06-11 06:58:40,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 211 flow [2021-06-11 06:58:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:58:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:58:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2021-06-11 06:58:40,054 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2021-06-11 06:58:40,054 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2021-06-11 06:58:40,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2021-06-11 06:58:40,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:40,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2021-06-11 06:58:40,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,057 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,057 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 173 flow. Second operand 7 states and 833 transitions. [2021-06-11 06:58:40,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 211 flow [2021-06-11 06:58:40,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 201 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-06-11 06:58:40,058 INFO L241 Difference]: Finished difference. Result has 52 places, 24 transitions, 166 flow [2021-06-11 06:58:40,058 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=52, PETRI_TRANSITIONS=24} [2021-06-11 06:58:40,058 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 25 predicate places. [2021-06-11 06:58:40,059 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:40,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 24 transitions, 166 flow [2021-06-11 06:58:40,059 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 24 transitions, 166 flow [2021-06-11 06:58:40,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 24 transitions, 166 flow [2021-06-11 06:58:40,062 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-06-11 06:58:40,062 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-06-11 06:58:40,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 29 events. 3/29 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 103. Up to 12 conditions per place. [2021-06-11 06:58:40,062 INFO L151 LiptonReduction]: Number of co-enabled transitions 56 [2021-06-11 06:58:40,063 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:58:40,063 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:58:40,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-06-11 06:58:40,064 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 24 transitions, 166 flow [2021-06-11 06:58:40,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,064 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:40,064 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:40,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:58:40,064 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash 341428733, now seen corresponding path program 1 times [2021-06-11 06:58:40,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:40,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638205657] [2021-06-11 06:58:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:58:40,125 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 06:58:40,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 06:58:40,143 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 06:58:40,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 06:58:40,168 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-06-11 06:58:40,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 06:58:40,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:40,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 06:58:40,216 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-06-11 06:58:40,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 06:58:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:58:40,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638205657] [2021-06-11 06:58:40,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:58:40,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:58:40,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267989374] [2021-06-11 06:58:40,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:58:40,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:58:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:58:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:58:40,226 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2021-06-11 06:58:40,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 24 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:58:40,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2021-06-11 06:58:40,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:58:40,289 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-06-11 06:58:40,289 INFO L130 PetriNetUnfolder]: For 109/120 co-relation queries the response was YES. [2021-06-11 06:58:40,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 38 events. 3/38 cut-off events. For 109/120 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 94 event pairs, 0 based on Foata normal form. 10/48 useless extension candidates. Maximal degree in co-relation 147. Up to 16 conditions per place. [2021-06-11 06:58:40,289 INFO L132 encePairwiseOnDemand]: 148/153 looper letters, 5 selfloop transitions, 4 changer transitions 4/26 dead transitions. [2021-06-11 06:58:40,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 26 transitions, 210 flow [2021-06-11 06:58:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:58:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:58:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2021-06-11 06:58:40,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6745098039215687 [2021-06-11 06:58:40,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2021-06-11 06:58:40,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2021-06-11 06:58:40,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:58:40,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2021-06-11 06:58:40,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,293 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,293 INFO L185 Difference]: Start difference. First operand has 50 places, 24 transitions, 166 flow. Second operand 5 states and 516 transitions. [2021-06-11 06:58:40,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 26 transitions, 210 flow [2021-06-11 06:58:40,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 26 transitions, 156 flow, removed 12 selfloop flow, removed 14 redundant places. [2021-06-11 06:58:40,294 INFO L241 Difference]: Finished difference. Result has 41 places, 22 transitions, 121 flow [2021-06-11 06:58:40,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=41, PETRI_TRANSITIONS=22} [2021-06-11 06:58:40,295 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2021-06-11 06:58:40,295 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:58:40,295 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 22 transitions, 121 flow [2021-06-11 06:58:40,295 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 22 transitions, 121 flow [2021-06-11 06:58:40,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 22 transitions, 121 flow [2021-06-11 06:58:40,298 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-06-11 06:58:40,298 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-11 06:58:40,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 25 events. 2/25 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 67. Up to 7 conditions per place. [2021-06-11 06:58:40,298 INFO L151 LiptonReduction]: Number of co-enabled transitions 34 [2021-06-11 06:58:40,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:58:40,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:58:40,326 INFO L163 LiptonReduction]: Checked pairs total: 1 [2021-06-11 06:58:40,326 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:58:40,326 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 06:58:40,327 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 119 flow [2021-06-11 06:58:40,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:58:40,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:58:40,327 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:58:40,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:58:40,327 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:58:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:58:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1178301361, now seen corresponding path program 2 times [2021-06-11 06:58:40,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:58:40,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827099867] [2021-06-11 06:58:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:58:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:58:40,349 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:58:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:58:40,369 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:58:40,385 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:58:40,386 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:58:40,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:58:40,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:58:40 BasicIcfg [2021-06-11 06:58:40,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:58:40,423 INFO L168 Benchmark]: Toolchain (without parser) took 18037.29 ms. Allocated memory was 360.7 MB in the beginning and 641.7 MB in the end (delta: 281.0 MB). Free memory was 323.4 MB in the beginning and 529.4 MB in the end (delta: -206.0 MB). Peak memory consumption was 76.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:40,423 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 360.7 MB. Free memory was 341.4 MB in the beginning and 341.3 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:58:40,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.48 ms. Allocated memory is still 360.7 MB. Free memory was 323.2 MB in the beginning and 319.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:40,424 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.27 ms. Allocated memory is still 360.7 MB. Free memory was 319.6 MB in the beginning and 317.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:40,424 INFO L168 Benchmark]: Boogie Preprocessor took 17.45 ms. Allocated memory is still 360.7 MB. Free memory was 317.5 MB in the beginning and 315.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:40,424 INFO L168 Benchmark]: RCFGBuilder took 1152.58 ms. Allocated memory is still 360.7 MB. Free memory was 315.4 MB in the beginning and 292.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 159.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:40,424 INFO L168 Benchmark]: TraceAbstraction took 16390.16 ms. Allocated memory was 360.7 MB in the beginning and 641.7 MB in the end (delta: 281.0 MB). Free memory was 292.7 MB in the beginning and 529.4 MB in the end (delta: -236.7 MB). Peak memory consumption was 44.3 MB. Max. memory is 16.0 GB. [2021-06-11 06:58:40,425 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.10 ms. Allocated memory is still 360.7 MB. Free memory was 341.4 MB in the beginning and 341.3 MB in the end (delta: 70.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 441.48 ms. Allocated memory is still 360.7 MB. Free memory was 323.2 MB in the beginning and 319.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.27 ms. Allocated memory is still 360.7 MB. Free memory was 319.6 MB in the beginning and 317.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.45 ms. Allocated memory is still 360.7 MB. Free memory was 317.5 MB in the beginning and 315.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1152.58 ms. Allocated memory is still 360.7 MB. Free memory was 315.4 MB in the beginning and 292.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 159.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16390.16 ms. Allocated memory was 360.7 MB in the beginning and 641.7 MB in the end (delta: 281.0 MB). Free memory was 292.7 MB in the beginning and 529.4 MB in the end (delta: -236.7 MB). Peak memory consumption was 44.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14589.1ms, 82 PlacesBefore, 27 PlacesAfterwards, 77 TransitionsBefore, 22 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 74 TotalNumberOfCompositions, 2570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1295, positive: 1183, positive conditional: 0, positive unconditional: 1183, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 721, positive: 680, positive conditional: 0, positive unconditional: 680, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 721, positive: 680, positive conditional: 0, positive unconditional: 680, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 721, positive: 665, positive conditional: 0, positive unconditional: 665, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 609, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 586, negative conditional: 0, negative unconditional: 586, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1295, positive: 503, positive conditional: 0, positive unconditional: 503, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 721, unknown conditional: 0, unknown unconditional: 721] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1309, Positive conditional cache size: 0, Positive unconditional cache size: 1309, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 181.9ms, 25 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 177, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1361, Positive cache size: 1314, Positive conditional cache size: 0, Positive unconditional cache size: 1314, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.0ms, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1365, Positive cache size: 1316, Positive conditional cache size: 0, Positive unconditional cache size: 1316, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5ms, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.6ms, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9ms, 43 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 36 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: 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: 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): 1367, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7ms, 52 PlacesBefore, 50 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: 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: 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): 1367, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.2ms, 41 PlacesBefore, 40 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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): 1430, Positive cache size: 1381, Positive conditional cache size: 0, Positive unconditional cache size: 1381, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2477; [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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] [L792] 0 pthread_t t2478; [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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] [L748] 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) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16293.2ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 494.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14635.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 20 SDslu, 31 SDs, 0 SdLazy, 177 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 174.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 243.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=6, InterpolantAutomatonStates: 40, 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: 23.7ms SsaConstructionTime, 182.5ms SatisfiabilityAnalysisTime, 510.1ms InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...