/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:37:10,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:37:10,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:37:10,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:37:10,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:37:10,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:37:10,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:37:10,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:37:10,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:37:10,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:37:10,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:37:10,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:37:10,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:37:10,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:37:10,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:37:10,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:37:10,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:37:10,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:37:10,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:37:10,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:37:10,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:37:10,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:37:10,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:37:10,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:37:10,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:37:10,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:37:10,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:37:10,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:37:10,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:37:10,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:37:10,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:37:10,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:37:10,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:37:10,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:37:10,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:37:10,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:37:10,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:37:10,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:37:10,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:37:10,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:37:10,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:37:10,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:37:10,979 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:37:10,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:37:10,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:37:10,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:37:10,983 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:37:10,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:37:10,983 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:37:10,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:37:10,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:37:10,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:37:10,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:37:10,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:37:10,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:37:10,985 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:37:10,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:37:10,985 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:37:10,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:37:10,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:37:10,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:37:10,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:37:10,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:37:10,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:37:10,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:37:10,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:37:10,988 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:37:11,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:37:11,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:37:11,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:37:11,297 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:37:11,298 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:37:11,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2021-03-26 10:37:11,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9aa9cd3a/4d962e15ab994de39673c30129be7e44/FLAG4d89ef7d9 [2021-03-26 10:37:11,915 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:37:11,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_rmo.opt.i [2021-03-26 10:37:11,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9aa9cd3a/4d962e15ab994de39673c30129be7e44/FLAG4d89ef7d9 [2021-03-26 10:37:12,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9aa9cd3a/4d962e15ab994de39673c30129be7e44 [2021-03-26 10:37:12,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:37:12,359 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:37:12,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:37:12,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:37:12,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:37:12,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12, skipping insertion in model container [2021-03-26 10:37:12,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:37:12,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:37:12,527 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/safe021_rmo.opt.i[949,962] [2021-03-26 10:37:12,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:37:12,754 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:37:12,768 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/safe021_rmo.opt.i[949,962] [2021-03-26 10:37:12,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:37:12,898 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:37:12,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12 WrapperNode [2021-03-26 10:37:12,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:37:12,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:37:12,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:37:12,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:37:12,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:37:12,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:37:12,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:37:12,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:37:12,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:12,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:13,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:13,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:13,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... [2021-03-26 10:37:13,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:37:13,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:37:13,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:37:13,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:37:13,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:37:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:37:13,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:37:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:37:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:37:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:37:13,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:37:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:37:13,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:37:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:37:13,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:37:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:37:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:37:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:37:13,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:37:13,096 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:37:14,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:37:14,774 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:37:14,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:37:14 BoogieIcfgContainer [2021-03-26 10:37:14,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:37:14,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:37:14,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:37:14,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:37:14,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:37:12" (1/3) ... [2021-03-26 10:37:14,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b3fd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:37:14, skipping insertion in model container [2021-03-26 10:37:14,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:37:12" (2/3) ... [2021-03-26 10:37:14,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b3fd13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:37:14, skipping insertion in model container [2021-03-26 10:37:14,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:37:14" (3/3) ... [2021-03-26 10:37:14,781 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_rmo.opt.i [2021-03-26 10:37:14,787 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:37:14,790 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:37:14,791 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:37:14,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,842 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,842 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,842 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,884 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,886 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,886 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:37:14,888 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:37:14,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:37:14,934 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:37:14,937 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:37:14,937 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:37:14,937 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:37:14,937 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:37:14,937 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:37:14,937 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:37:14,937 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:37:14,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 10:37:14,982 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 10:37:14,982 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:37:14,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:37:14,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 10:37:14,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-26 10:37:14,992 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:15,004 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 10:37:15,007 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 10:37:15,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-26 10:37:15,026 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 10:37:15,026 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:37:15,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:37:15,029 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-26 10:37:16,326 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:37:16,735 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:37:16,866 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:37:17,827 INFO L154 LiptonReduction]: Checked pairs total: 2879 [2021-03-26 10:37:17,827 INFO L156 LiptonReduction]: Total number of compositions: 60 [2021-03-26 10:37:17,831 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2840 [2021-03-26 10:37:17,861 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 10:37:17,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:37:17,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:17,862 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:17,863 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash 653473242, now seen corresponding path program 1 times [2021-03-26 10:37:17,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:17,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266419014] [2021-03-26 10:37:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:18,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:18,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:37:18,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:18,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:18,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266419014] [2021-03-26 10:37:18,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:18,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:37:18,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100519184] [2021-03-26 10:37:18,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:37:18,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:37:18,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:37:18,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 158 [2021-03-26 10:37:18,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:18,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:18,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 158 [2021-03-26 10:37:18,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:18,262 INFO L129 PetriNetUnfolder]: 49/144 cut-off events. [2021-03-26 10:37:18,262 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:37:18,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 144 events. 49/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 615 event pairs, 9 based on Foata normal form. 16/152 useless extension candidates. Maximal degree in co-relation 218. Up to 65 conditions per place. [2021-03-26 10:37:18,266 INFO L132 encePairwiseOnDemand]: 154/158 looper letters, 9 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2021-03-26 10:37:18,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 117 flow [2021-03-26 10:37:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:37:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:37:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2021-03-26 10:37:18,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966244725738397 [2021-03-26 10:37:18,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2021-03-26 10:37:18,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2021-03-26 10:37:18,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:18,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2021-03-26 10:37:18,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:18,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:18,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:18,314 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 93 flow. Second operand 3 states and 425 transitions. [2021-03-26 10:37:18,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 117 flow [2021-03-26 10:37:18,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:37:18,320 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2021-03-26 10:37:18,322 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2021-03-26 10:37:18,323 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-26 10:37:18,323 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:18,323 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-26 10:37:18,324 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 39 transitions, 88 flow [2021-03-26 10:37:18,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 88 flow [2021-03-26 10:37:18,335 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-03-26 10:37:18,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:37:18,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:37:18,337 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-26 10:37:18,613 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:37:18,747 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:37:20,132 INFO L154 LiptonReduction]: Checked pairs total: 1428 [2021-03-26 10:37:20,132 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 10:37:20,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1809 [2021-03-26 10:37:20,134 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:37:20,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:20,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:20,134 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:20,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:37:20,135 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1865987628, now seen corresponding path program 1 times [2021-03-26 10:37:20,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:20,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930404439] [2021-03-26 10:37:20,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:20,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:20,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:37:20,236 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-26 10:37:20,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:20,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:20,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:37:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:20,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930404439] [2021-03-26 10:37:20,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:20,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:37:20,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101330928] [2021-03-26 10:37:20,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:37:20,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:20,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:37:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:37:20,254 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 173 [2021-03-26 10:37:20,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:20,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:20,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 173 [2021-03-26 10:37:20,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:20,334 INFO L129 PetriNetUnfolder]: 54/176 cut-off events. [2021-03-26 10:37:20,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:37:20,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 176 events. 54/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 864 event pairs, 6 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 284. Up to 45 conditions per place. [2021-03-26 10:37:20,335 INFO L132 encePairwiseOnDemand]: 166/173 looper letters, 6 selfloop transitions, 5 changer transitions 10/37 dead transitions. [2021-03-26 10:37:20,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 126 flow [2021-03-26 10:37:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:37:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:37:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2021-03-26 10:37:20,338 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.823121387283237 [2021-03-26 10:37:20,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2021-03-26 10:37:20,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2021-03-26 10:37:20,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:20,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2021-03-26 10:37:20,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:20,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:20,343 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:20,343 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 712 transitions. [2021-03-26 10:37:20,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 126 flow [2021-03-26 10:37:20,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:37:20,344 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 98 flow [2021-03-26 10:37:20,345 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2021-03-26 10:37:20,345 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2021-03-26 10:37:20,345 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:20,345 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 98 flow [2021-03-26 10:37:20,346 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 98 flow [2021-03-26 10:37:20,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 98 flow [2021-03-26 10:37:20,366 INFO L129 PetriNetUnfolder]: 24/122 cut-off events. [2021-03-26 10:37:20,367 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-03-26 10:37:20,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 122 events. 24/122 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 590 event pairs, 10 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 222. Up to 45 conditions per place. [2021-03-26 10:37:20,372 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 10:37:21,020 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:37:21,169 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:37:21,488 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:37:21,618 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:37:21,621 INFO L154 LiptonReduction]: Checked pairs total: 702 [2021-03-26 10:37:21,622 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:37:21,622 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1277 [2021-03-26 10:37:21,622 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 94 flow [2021-03-26 10:37:21,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:21,623 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:21,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:37:21,623 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2120242467, now seen corresponding path program 1 times [2021-03-26 10:37:21,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:21,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242333396] [2021-03-26 10:37:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:21,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:21,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:21,701 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-26 10:37:21,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:21,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242333396] [2021-03-26 10:37:21,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:21,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:37:21,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391090458] [2021-03-26 10:37:21,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:37:21,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:37:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:37:21,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 175 [2021-03-26 10:37:21,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:21,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 175 [2021-03-26 10:37:21,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:21,745 INFO L129 PetriNetUnfolder]: 21/100 cut-off events. [2021-03-26 10:37:21,745 INFO L130 PetriNetUnfolder]: For 40/72 co-relation queries the response was YES. [2021-03-26 10:37:21,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 100 events. 21/100 cut-off events. For 40/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 428 event pairs, 4 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 241. Up to 40 conditions per place. [2021-03-26 10:37:21,747 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 6 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2021-03-26 10:37:21,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 130 flow [2021-03-26 10:37:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:37:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:37:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2021-03-26 10:37:21,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8271428571428572 [2021-03-26 10:37:21,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2021-03-26 10:37:21,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2021-03-26 10:37:21,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:21,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2021-03-26 10:37:21,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,765 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,765 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 94 flow. Second operand 4 states and 579 transitions. [2021-03-26 10:37:21,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 130 flow [2021-03-26 10:37:21,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 108 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-26 10:37:21,767 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 114 flow [2021-03-26 10:37:21,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-26 10:37:21,767 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2021-03-26 10:37:21,768 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:21,768 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 114 flow [2021-03-26 10:37:21,768 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 114 flow [2021-03-26 10:37:21,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 114 flow [2021-03-26 10:37:21,781 INFO L129 PetriNetUnfolder]: 21/112 cut-off events. [2021-03-26 10:37:21,781 INFO L130 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2021-03-26 10:37:21,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 112 events. 21/112 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 562 event pairs, 10 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 216. Up to 40 conditions per place. [2021-03-26 10:37:21,783 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-26 10:37:21,789 INFO L154 LiptonReduction]: Checked pairs total: 286 [2021-03-26 10:37:21,789 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:37:21,789 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:37:21,793 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 114 flow [2021-03-26 10:37:21,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:21,793 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:21,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:37:21,794 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -301451173, now seen corresponding path program 1 times [2021-03-26 10:37:21,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:21,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032147901] [2021-03-26 10:37:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:21,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:21,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:21,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-03-26 10:37:21,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032147901] [2021-03-26 10:37:21,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:21,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:37:21,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897663774] [2021-03-26 10:37:21,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:37:21,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:21,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:37:21,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:37:21,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 175 [2021-03-26 10:37:21,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:21,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 175 [2021-03-26 10:37:21,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:21,892 INFO L129 PetriNetUnfolder]: 15/84 cut-off events. [2021-03-26 10:37:21,893 INFO L130 PetriNetUnfolder]: For 76/100 co-relation queries the response was YES. [2021-03-26 10:37:21,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 84 events. 15/84 cut-off events. For 76/100 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 335 event pairs, 3 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 190. Up to 32 conditions per place. [2021-03-26 10:37:21,894 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 6 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2021-03-26 10:37:21,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 154 flow [2021-03-26 10:37:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:37:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:37:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:37:21,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2021-03-26 10:37:21,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:37:21,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:37:21,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:21,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:37:21,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,899 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 114 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:37:21,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 154 flow [2021-03-26 10:37:21,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:37:21,901 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 152 flow [2021-03-26 10:37:21,901 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-03-26 10:37:21,901 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2021-03-26 10:37:21,901 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:21,901 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 152 flow [2021-03-26 10:37:21,902 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 152 flow [2021-03-26 10:37:21,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 152 flow [2021-03-26 10:37:21,911 INFO L129 PetriNetUnfolder]: 15/90 cut-off events. [2021-03-26 10:37:21,912 INFO L130 PetriNetUnfolder]: For 53/62 co-relation queries the response was YES. [2021-03-26 10:37:21,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 90 events. 15/90 cut-off events. For 53/62 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 407 event pairs, 4 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 199. Up to 32 conditions per place. [2021-03-26 10:37:21,913 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-26 10:37:21,915 INFO L154 LiptonReduction]: Checked pairs total: 362 [2021-03-26 10:37:21,915 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:37:21,916 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:37:21,916 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 152 flow [2021-03-26 10:37:21,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:21,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:21,917 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:21,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:37:21,917 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash -755053723, now seen corresponding path program 1 times [2021-03-26 10:37:21,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:21,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074642642] [2021-03-26 10:37:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:21,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:21,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:21,998 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-26 10:37:21,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:22,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074642642] [2021-03-26 10:37:22,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:22,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:37:22,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048423087] [2021-03-26 10:37:22,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:37:22,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:37:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:37:22,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 175 [2021-03-26 10:37:22,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,018 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:22,018 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 175 [2021-03-26 10:37:22,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:22,081 INFO L129 PetriNetUnfolder]: 35/136 cut-off events. [2021-03-26 10:37:22,081 INFO L130 PetriNetUnfolder]: For 149/218 co-relation queries the response was YES. [2021-03-26 10:37:22,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 136 events. 35/136 cut-off events. For 149/218 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 633 event pairs, 2 based on Foata normal form. 11/146 useless extension candidates. Maximal degree in co-relation 377. Up to 46 conditions per place. [2021-03-26 10:37:22,083 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 12 selfloop transitions, 19 changer transitions 0/45 dead transitions. [2021-03-26 10:37:22,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 318 flow [2021-03-26 10:37:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:37:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:37:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions. [2021-03-26 10:37:22,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.824 [2021-03-26 10:37:22,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 721 transitions. [2021-03-26 10:37:22,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 721 transitions. [2021-03-26 10:37:22,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:22,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 721 transitions. [2021-03-26 10:37:22,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,089 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,090 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 152 flow. Second operand 5 states and 721 transitions. [2021-03-26 10:37:22,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 318 flow [2021-03-26 10:37:22,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 309 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:37:22,095 INFO L241 Difference]: Finished difference. Result has 45 places, 42 transitions, 323 flow [2021-03-26 10:37:22,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2021-03-26 10:37:22,095 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2021-03-26 10:37:22,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:22,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 42 transitions, 323 flow [2021-03-26 10:37:22,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 42 transitions, 323 flow [2021-03-26 10:37:22,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 323 flow [2021-03-26 10:37:22,121 INFO L129 PetriNetUnfolder]: 29/130 cut-off events. [2021-03-26 10:37:22,121 INFO L130 PetriNetUnfolder]: For 215/247 co-relation queries the response was YES. [2021-03-26 10:37:22,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 130 events. 29/130 cut-off events. For 215/247 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 642 event pairs, 3 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 414. Up to 46 conditions per place. [2021-03-26 10:37:22,123 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 10:37:22,281 INFO L154 LiptonReduction]: Checked pairs total: 536 [2021-03-26 10:37:22,281 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:37:22,281 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 186 [2021-03-26 10:37:22,284 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 323 flow [2021-03-26 10:37:22,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,285 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:22,285 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:22,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:37:22,285 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash -755051863, now seen corresponding path program 2 times [2021-03-26 10:37:22,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:22,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151111679] [2021-03-26 10:37:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:22,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:22,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:22,348 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-26 10:37:22,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:22,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151111679] [2021-03-26 10:37:22,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:22,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:37:22,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353992918] [2021-03-26 10:37:22,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:37:22,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:37:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:37:22,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 175 [2021-03-26 10:37:22,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 323 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:22,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 175 [2021-03-26 10:37:22,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:22,417 INFO L129 PetriNetUnfolder]: 24/132 cut-off events. [2021-03-26 10:37:22,417 INFO L130 PetriNetUnfolder]: For 392/530 co-relation queries the response was YES. [2021-03-26 10:37:22,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 132 events. 24/132 cut-off events. For 392/530 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 681 event pairs, 2 based on Foata normal form. 13/144 useless extension candidates. Maximal degree in co-relation 457. Up to 40 conditions per place. [2021-03-26 10:37:22,418 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 7 selfloop transitions, 7 changer transitions 19/47 dead transitions. [2021-03-26 10:37:22,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 445 flow [2021-03-26 10:37:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:37:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:37:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-26 10:37:22,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8171428571428572 [2021-03-26 10:37:22,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-26 10:37:22,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-26 10:37:22,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:22,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-26 10:37:22,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,425 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,425 INFO L185 Difference]: Start difference. First operand has 45 places, 42 transitions, 323 flow. Second operand 5 states and 715 transitions. [2021-03-26 10:37:22,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 445 flow [2021-03-26 10:37:22,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:37:22,429 INFO L241 Difference]: Finished difference. Result has 51 places, 28 transitions, 198 flow [2021-03-26 10:37:22,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2021-03-26 10:37:22,430 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2021-03-26 10:37:22,430 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:22,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 28 transitions, 198 flow [2021-03-26 10:37:22,431 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 28 transitions, 198 flow [2021-03-26 10:37:22,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 28 transitions, 198 flow [2021-03-26 10:37:22,442 INFO L129 PetriNetUnfolder]: 6/60 cut-off events. [2021-03-26 10:37:22,443 INFO L130 PetriNetUnfolder]: For 143/145 co-relation queries the response was YES. [2021-03-26 10:37:22,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 60 events. 6/60 cut-off events. For 143/145 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 195 event pairs, 2 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 192. Up to 16 conditions per place. [2021-03-26 10:37:22,444 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 10:37:22,475 INFO L154 LiptonReduction]: Checked pairs total: 300 [2021-03-26 10:37:22,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:37:22,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-26 10:37:22,477 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 198 flow [2021-03-26 10:37:22,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:22,478 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:22,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:37:22,478 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash -446058527, now seen corresponding path program 1 times [2021-03-26 10:37:22,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:22,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412367812] [2021-03-26 10:37:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:22,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:22,536 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:37:22,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:22,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:37:22,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-03-26 10:37:22,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412367812] [2021-03-26 10:37:22,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:22,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:37:22,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446608560] [2021-03-26 10:37:22,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:37:22,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:37:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:37:22,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2021-03-26 10:37:22,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 28 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:22,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2021-03-26 10:37:22,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:22,598 INFO L129 PetriNetUnfolder]: 83/217 cut-off events. [2021-03-26 10:37:22,598 INFO L130 PetriNetUnfolder]: For 436/463 co-relation queries the response was YES. [2021-03-26 10:37:22,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 217 events. 83/217 cut-off events. For 436/463 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1193 event pairs, 37 based on Foata normal form. 20/222 useless extension candidates. Maximal degree in co-relation 588. Up to 125 conditions per place. [2021-03-26 10:37:22,600 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 7 selfloop transitions, 7 changer transitions 2/38 dead transitions. [2021-03-26 10:37:22,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 38 transitions, 250 flow [2021-03-26 10:37:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:37:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:37:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 10:37:22,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8662857142857143 [2021-03-26 10:37:22,602 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 10:37:22,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 10:37:22,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:22,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 10:37:22,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,606 INFO L185 Difference]: Start difference. First operand has 51 places, 28 transitions, 198 flow. Second operand 5 states and 758 transitions. [2021-03-26 10:37:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 38 transitions, 250 flow [2021-03-26 10:37:22,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 187 flow, removed 12 selfloop flow, removed 10 redundant places. [2021-03-26 10:37:22,609 INFO L241 Difference]: Finished difference. Result has 48 places, 34 transitions, 189 flow [2021-03-26 10:37:22,609 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2021-03-26 10:37:22,609 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2021-03-26 10:37:22,609 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:22,609 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 34 transitions, 189 flow [2021-03-26 10:37:22,609 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 34 transitions, 189 flow [2021-03-26 10:37:22,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 34 transitions, 189 flow [2021-03-26 10:37:22,626 INFO L129 PetriNetUnfolder]: 76/205 cut-off events. [2021-03-26 10:37:22,627 INFO L130 PetriNetUnfolder]: For 136/191 co-relation queries the response was YES. [2021-03-26 10:37:22,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 205 events. 76/205 cut-off events. For 136/191 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1116 event pairs, 33 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 567. Up to 127 conditions per place. [2021-03-26 10:37:22,629 INFO L142 LiptonReduction]: Number of co-enabled transitions 332 [2021-03-26 10:37:22,753 INFO L154 LiptonReduction]: Checked pairs total: 552 [2021-03-26 10:37:22,753 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:37:22,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 10:37:22,757 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 183 flow [2021-03-26 10:37:22,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,757 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:22,757 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:22,757 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:37:22,757 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2036099883, now seen corresponding path program 1 times [2021-03-26 10:37:22,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:22,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819514400] [2021-03-26 10:37:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:22,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:22,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:22,838 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:37:22,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:22,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:22,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:37:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:22,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819514400] [2021-03-26 10:37:22,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:22,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:37:22,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974258168] [2021-03-26 10:37:22,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:37:22,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:37:22,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:37:22,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2021-03-26 10:37:22,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:22,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2021-03-26 10:37:22,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:22,902 INFO L129 PetriNetUnfolder]: 41/138 cut-off events. [2021-03-26 10:37:22,902 INFO L130 PetriNetUnfolder]: For 153/219 co-relation queries the response was YES. [2021-03-26 10:37:22,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 138 events. 41/138 cut-off events. For 153/219 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 634 event pairs, 6 based on Foata normal form. 37/171 useless extension candidates. Maximal degree in co-relation 467. Up to 87 conditions per place. [2021-03-26 10:37:22,903 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 10 changer transitions 4/41 dead transitions. [2021-03-26 10:37:22,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 267 flow [2021-03-26 10:37:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:37:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:37:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions. [2021-03-26 10:37:22,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8657142857142858 [2021-03-26 10:37:22,906 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 909 transitions. [2021-03-26 10:37:22,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions. [2021-03-26 10:37:22,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:22,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions. [2021-03-26 10:37:22,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,911 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,911 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 183 flow. Second operand 6 states and 909 transitions. [2021-03-26 10:37:22,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 267 flow [2021-03-26 10:37:22,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 253 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:37:22,914 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 237 flow [2021-03-26 10:37:22,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-26 10:37:22,914 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2021-03-26 10:37:22,915 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:22,915 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 237 flow [2021-03-26 10:37:22,915 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 237 flow [2021-03-26 10:37:22,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 237 flow [2021-03-26 10:37:22,931 INFO L129 PetriNetUnfolder]: 32/128 cut-off events. [2021-03-26 10:37:22,931 INFO L130 PetriNetUnfolder]: For 225/254 co-relation queries the response was YES. [2021-03-26 10:37:22,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 128 events. 32/128 cut-off events. For 225/254 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 597 event pairs, 4 based on Foata normal form. 3/129 useless extension candidates. Maximal degree in co-relation 461. Up to 78 conditions per place. [2021-03-26 10:37:22,933 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 10:37:22,940 INFO L154 LiptonReduction]: Checked pairs total: 667 [2021-03-26 10:37:22,940 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:37:22,940 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 10:37:22,941 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 229 flow [2021-03-26 10:37:22,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:22,941 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:22,941 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:22,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:37:22,943 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1209001527, now seen corresponding path program 1 times [2021-03-26 10:37:22,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:22,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338039076] [2021-03-26 10:37:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:37:23,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:23,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:23,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:23,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:23,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:23,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:37:23,078 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:37:23,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:37:23,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:37:23,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:37:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:37:23,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338039076] [2021-03-26 10:37:23,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:37:23,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:37:23,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736313674] [2021-03-26 10:37:23,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:37:23,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:37:23,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:37:23,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:37:23,088 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2021-03-26 10:37:23,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:23,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:37:23,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2021-03-26 10:37:23,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:37:23,140 INFO L129 PetriNetUnfolder]: 19/82 cut-off events. [2021-03-26 10:37:23,141 INFO L130 PetriNetUnfolder]: For 209/263 co-relation queries the response was YES. [2021-03-26 10:37:23,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 82 events. 19/82 cut-off events. For 209/263 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 267 event pairs, 0 based on Foata normal form. 30/110 useless extension candidates. Maximal degree in co-relation 320. Up to 48 conditions per place. [2021-03-26 10:37:23,141 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 2 selfloop transitions, 11 changer transitions 3/38 dead transitions. [2021-03-26 10:37:23,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 38 transitions, 273 flow [2021-03-26 10:37:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:37:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:37:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-03-26 10:37:23,144 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8604081632653061 [2021-03-26 10:37:23,144 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-03-26 10:37:23,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-03-26 10:37:23,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:37:23,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-03-26 10:37:23,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:23,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:23,151 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:23,151 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 229 flow. Second operand 7 states and 1054 transitions. [2021-03-26 10:37:23,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 38 transitions, 273 flow [2021-03-26 10:37:23,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 38 transitions, 244 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 10:37:23,159 INFO L241 Difference]: Finished difference. Result has 54 places, 35 transitions, 224 flow [2021-03-26 10:37:23,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2021-03-26 10:37:23,159 INFO L343 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2021-03-26 10:37:23,159 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:37:23,159 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 35 transitions, 224 flow [2021-03-26 10:37:23,159 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 35 transitions, 224 flow [2021-03-26 10:37:23,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 35 transitions, 224 flow [2021-03-26 10:37:23,168 INFO L129 PetriNetUnfolder]: 15/76 cut-off events. [2021-03-26 10:37:23,168 INFO L130 PetriNetUnfolder]: For 123/126 co-relation queries the response was YES. [2021-03-26 10:37:23,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 76 events. 15/76 cut-off events. For 123/126 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 244 event pairs, 0 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 262. Up to 29 conditions per place. [2021-03-26 10:37:23,169 INFO L142 LiptonReduction]: Number of co-enabled transitions 216 [2021-03-26 10:37:23,453 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:37:23,585 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:37:23,791 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-26 10:37:23,952 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:37:24,092 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:37:24,096 INFO L154 LiptonReduction]: Checked pairs total: 775 [2021-03-26 10:37:24,096 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:37:24,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 938 [2021-03-26 10:37:24,097 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 210 flow [2021-03-26 10:37:24,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:37:24,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:37:24,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:37:24,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:37:24,098 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:37:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:37:24,098 INFO L82 PathProgramCache]: Analyzing trace with hash -306788341, now seen corresponding path program 1 times [2021-03-26 10:37:24,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:37:24,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161263283] [2021-03-26 10:37:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:37:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:37:24,137 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:37:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:37:24,198 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:37:24,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:37:24,240 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:37:24,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:37:24,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:37:24 BasicIcfg [2021-03-26 10:37:24,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:37:24,348 INFO L168 Benchmark]: Toolchain (without parser) took 11987.60 ms. Allocated memory was 255.9 MB in the beginning and 522.2 MB in the end (delta: 266.3 MB). Free memory was 235.1 MB in the beginning and 378.9 MB in the end (delta: -143.8 MB). Peak memory consumption was 121.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:37:24,348 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:37:24,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.89 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 234.6 MB in the beginning and 307.3 MB in the end (delta: -72.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:37:24,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.06 ms. Allocated memory is still 348.1 MB. Free memory was 307.3 MB in the beginning and 305.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:37:24,348 INFO L168 Benchmark]: Boogie Preprocessor took 53.18 ms. Allocated memory is still 348.1 MB. Free memory was 305.1 MB in the beginning and 302.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:37:24,349 INFO L168 Benchmark]: RCFGBuilder took 1747.96 ms. Allocated memory is still 348.1 MB. Free memory was 302.5 MB in the beginning and 238.0 MB in the end (delta: 64.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:37:24,349 INFO L168 Benchmark]: TraceAbstraction took 9569.65 ms. Allocated memory was 348.1 MB in the beginning and 522.2 MB in the end (delta: 174.1 MB). Free memory was 238.0 MB in the beginning and 378.9 MB in the end (delta: -140.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:37:24,353 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 539.89 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 234.6 MB in the beginning and 307.3 MB in the end (delta: -72.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.06 ms. Allocated memory is still 348.1 MB. Free memory was 307.3 MB in the beginning and 305.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.18 ms. Allocated memory is still 348.1 MB. Free memory was 305.1 MB in the beginning and 302.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1747.96 ms. Allocated memory is still 348.1 MB. Free memory was 302.5 MB in the beginning and 238.0 MB in the end (delta: 64.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9569.65 ms. Allocated memory was 348.1 MB in the beginning and 522.2 MB in the end (delta: 174.1 MB). Free memory was 238.0 MB in the beginning and 378.9 MB in the end (delta: -140.9 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2820.7ms, 103 PlacesBefore, 51 PlacesAfterwards, 95 TransitionsBefore, 42 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 4 FixpointIterations, 24 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 60 TotalNumberOfCompositions, 2879 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1467, positive: 1394, positive conditional: 1394, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1467, positive: 1394, positive conditional: 0, positive unconditional: 1394, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1467, positive: 1394, positive conditional: 0, positive unconditional: 1394, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, positive: 1073, positive conditional: 0, positive unconditional: 1073, 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: 1114, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 523, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 500, negative conditional: 0, negative unconditional: 500, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1467, positive: 321, positive conditional: 0, positive unconditional: 321, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 1114, unknown conditional: 0, unknown unconditional: 1114] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1073, Positive conditional cache size: 0, Positive unconditional cache size: 1073, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1808.1ms, 48 PlacesBefore, 33 PlacesAfterwards, 39 TransitionsBefore, 24 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 1428 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 459, positive: 366, positive conditional: 366, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 459, positive: 366, positive conditional: 10, positive unconditional: 356, negative: 93, negative conditional: 4, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 459, positive: 366, positive conditional: 10, positive unconditional: 356, negative: 93, negative conditional: 4, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, positive: 104, positive conditional: 6, positive unconditional: 98, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 307, negative conditional: 41, negative unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 459, positive: 262, positive conditional: 4, positive unconditional: 258, negative: 71, negative conditional: 2, negative unconditional: 69, unknown: 126, unknown conditional: 8, unknown unconditional: 118] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1177, Positive conditional cache size: 6, Positive unconditional cache size: 1171, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1275.9ms, 39 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 702 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, positive: 121, positive conditional: 121, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1249, Positive cache size: 1185, Positive conditional cache size: 6, Positive unconditional cache size: 1179, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3ms, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 286 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1249, Positive cache size: 1185, Positive conditional cache size: 6, Positive unconditional cache size: 1179, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 362 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 81, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1194, Positive conditional cache size: 6, Positive unconditional cache size: 1188, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.9ms, 45 PlacesBefore, 45 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 536 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 153, negative conditional: 0, negative unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1197, Positive conditional cache size: 6, Positive unconditional cache size: 1191, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.1ms, 51 PlacesBefore, 51 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 300 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1267, Positive cache size: 1198, Positive conditional cache size: 6, Positive unconditional cache size: 1192, Negative cache size: 69, Negative conditional cache size: 2, Negative unconditional cache size: 67, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.8ms, 48 PlacesBefore, 48 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 552 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1277, Positive cache size: 1203, Positive conditional cache size: 11, Positive unconditional cache size: 1192, Negative cache size: 74, Negative conditional cache size: 2, Negative unconditional cache size: 72, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.3ms, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 667 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, positive: 31, positive conditional: 10, positive unconditional: 21, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 31, positive conditional: 10, positive unconditional: 21, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 67, positive: 26, positive conditional: 6, positive unconditional: 20, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1282, Positive cache size: 1208, Positive conditional cache size: 15, Positive unconditional cache size: 1193, Negative cache size: 74, Negative conditional cache size: 2, Negative unconditional cache size: 72, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 937.1ms, 54 PlacesBefore, 50 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 775 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 60, positive conditional: 27, positive unconditional: 33, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 60, positive conditional: 27, positive unconditional: 33, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 111, positive: 56, positive conditional: 23, positive unconditional: 33, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1286, Positive cache size: 1212, Positive conditional cache size: 19, Positive unconditional cache size: 1193, Negative cache size: 74, Negative conditional cache size: 2, Negative unconditional cache size: 72, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2296; [L834] FCALL, FORK 0 pthread_create(&t2296, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t2297; [L836] FCALL, FORK 0 pthread_create(&t2297, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t2298; [L838] FCALL, FORK 0 pthread_create(&t2298, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = z [L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L844] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 22.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9312.6ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 692.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2901.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 36 SDslu, 31 SDs, 0 SdLazy, 136 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 156.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 142.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=5, InterpolantAutomatonStates: 43, 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: 31.1ms SsaConstructionTime, 341.0ms SatisfiabilityAnalysisTime, 545.6ms InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 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...