/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:29:33,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:29:33,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:29:33,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:29:33,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:29:33,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:29:33,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:29:33,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:29:33,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:29:33,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:29:33,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:29:33,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:29:33,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:29:33,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:29:33,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:29:33,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:29:33,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:29:33,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:29:33,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:29:33,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:29:33,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:29:33,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:29:33,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:29:33,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:29:33,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:29:33,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:29:33,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:29:33,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:29:33,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:29:33,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:29:33,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:29:33,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:29:33,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:29:33,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:29:33,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:29:33,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:29:33,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:29:33,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:29:33,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:29:33,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:29:33,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:29:33,663 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:29:33,681 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:29:33,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:29:33,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:29:33,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:29:33,683 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:29:33,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:29:33,683 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:29:33,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:29:33,684 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:29:33,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:29:33,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:29:33,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:29:33,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:29:33,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:29:33,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:29:33,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:29:33,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:29:33,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:29:33,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:29:33,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:29:33,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:29:33,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:29:33,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:29:34,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:29:34,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:29:34,014 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:29:34,015 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:29:34,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-03-11 20:29:34,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee346d09e/efbd6491664e4ef8aed52890cdcf8fbc/FLAG2126bc15d [2021-03-11 20:29:34,571 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:29:34,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-03-11 20:29:34,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee346d09e/efbd6491664e4ef8aed52890cdcf8fbc/FLAG2126bc15d [2021-03-11 20:29:35,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee346d09e/efbd6491664e4ef8aed52890cdcf8fbc [2021-03-11 20:29:35,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:29:35,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:29:35,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:29:35,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:29:35,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:29:35,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f4e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35, skipping insertion in model container [2021-03-11 20:29:35,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:29:35,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:29:35,229 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/safe032_pso.oepc.i[993,1006] [2021-03-11 20:29:35,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:29:35,453 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:29:35,465 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/safe032_pso.oepc.i[993,1006] [2021-03-11 20:29:35,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:29:35,606 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:29:35,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35 WrapperNode [2021-03-11 20:29:35,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:29:35,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:29:35,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:29:35,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:29:35,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:29:35,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:29:35,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:29:35,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:29:35,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (1/1) ... [2021-03-11 20:29:35,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:29:35,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:29:35,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:29:35,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:29:35,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (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-11 20:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:29:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:29:35,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:29:35,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:29:35,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:29:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:29:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:29:35,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:29:35,770 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:29:38,152 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:29:38,152 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:29:38,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:29:38 BoogieIcfgContainer [2021-03-11 20:29:38,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:29:38,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:29:38,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:29:38,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:29:38,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:29:35" (1/3) ... [2021-03-11 20:29:38,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29402be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:29:38, skipping insertion in model container [2021-03-11 20:29:38,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:29:35" (2/3) ... [2021-03-11 20:29:38,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29402be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:29:38, skipping insertion in model container [2021-03-11 20:29:38,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:29:38" (3/3) ... [2021-03-11 20:29:38,161 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.oepc.i [2021-03-11 20:29:38,166 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:29:38,169 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:29:38,170 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:29:38,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,251 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:29:38,276 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:29:38,291 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:29:38,317 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:29:38,317 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:29:38,317 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:29:38,317 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:29:38,317 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:29:38,317 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:29:38,317 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:29:38,317 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:29:38,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 20:29:38,375 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 20:29:38,375 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:29:38,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 20:29:38,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 20:29:38,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-11 20:29:38,389 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:29:38,398 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-11 20:29:38,400 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-11 20:29:38,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-11 20:29:38,432 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 20:29:38,432 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:29:38,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 20:29:38,436 INFO L116 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-11 20:29:38,870 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:29:39,300 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:29:39,409 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:29:40,456 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-11 20:29:40,716 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 20:29:42,093 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 20:29:42,610 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:29:44,201 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:29:44,339 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:29:45,344 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-11 20:29:45,613 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-11 20:29:46,777 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 269 DAG size of output: 268 [2021-03-11 20:29:47,304 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 20:29:47,579 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 20:29:47,841 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 20:29:48,407 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:29:48,976 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:29:49,909 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:29:50,173 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:29:50,724 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 20:29:51,266 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 20:29:51,843 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-03-11 20:29:52,018 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-03-11 20:29:52,382 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 20:29:52,663 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-11 20:29:53,418 WARN L205 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 20:29:54,225 WARN L205 SmtUtils]: Spent 806.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-03-11 20:29:54,584 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-11 20:29:54,700 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 20:29:54,948 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-11 20:29:55,072 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 20:29:55,091 INFO L131 LiptonReduction]: Checked pairs total: 4922 [2021-03-11 20:29:55,092 INFO L133 LiptonReduction]: Total number of compositions: 82 [2021-03-11 20:29:55,093 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16706 [2021-03-11 20:29:55,101 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-11 20:29:55,101 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:29:55,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:55,101 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:55,101 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash 186395172, now seen corresponding path program 1 times [2021-03-11 20:29:55,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:55,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952256934] [2021-03-11 20:29:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:55,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:55,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:29:55,334 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-11 20:29:55,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952256934] [2021-03-11 20:29:55,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:55,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:29:55,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217617493] [2021-03-11 20:29:55,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:29:55,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:29:55,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:29:55,352 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 179 [2021-03-11 20:29:55,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 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-11 20:29:55,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:55,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 179 [2021-03-11 20:29:55,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:55,485 INFO L129 PetriNetUnfolder]: 161/288 cut-off events. [2021-03-11 20:29:55,485 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:29:55,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 288 events. 161/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1217 event pairs, 57 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 546. Up to 193 conditions per place. [2021-03-11 20:29:55,488 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 13 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2021-03-11 20:29:55,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 101 flow [2021-03-11 20:29:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:29:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:29:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2021-03-11 20:29:55,504 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8212290502793296 [2021-03-11 20:29:55,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2021-03-11 20:29:55,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2021-03-11 20:29:55,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:55,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2021-03-11 20:29:55,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-11 20:29:55,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:55,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:55,526 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 441 transitions. [2021-03-11 20:29:55,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 101 flow [2021-03-11 20:29:55,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:29:55,530 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2021-03-11 20:29:55,531 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2021-03-11 20:29:55,532 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:29:55,532 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2021-03-11 20:29:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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-11 20:29:55,532 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:55,533 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:55,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:29:55,533 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1262804229, now seen corresponding path program 1 times [2021-03-11 20:29:55,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:55,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873216391] [2021-03-11 20:29:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:55,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:55,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:29:55,672 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-11 20:29:55,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873216391] [2021-03-11 20:29:55,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:55,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:29:55,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749924541] [2021-03-11 20:29:55,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:29:55,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:29:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:29:55,674 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-11 20:29:55,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 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-11 20:29:55,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:55,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-11 20:29:55,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:55,687 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-11 20:29:55,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:29:55,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 43. Up to 10 conditions per place. [2021-03-11 20:29:55,688 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-11 20:29:55,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 68 flow [2021-03-11 20:29:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:29:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:29:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-11 20:29:55,690 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8566108007448789 [2021-03-11 20:29:55,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-11 20:29:55,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-11 20:29:55,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:55,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-11 20:29:55,692 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-11 20:29:55,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:55,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:55,693 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 460 transitions. [2021-03-11 20:29:55,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 68 flow [2021-03-11 20:29:55,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:29:55,694 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 67 flow [2021-03-11 20:29:55,694 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2021-03-11 20:29:55,695 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:29:55,695 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-11 20:29:55,695 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-11 20:29:55,696 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:55,696 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:55,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:29:55,696 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1044498774, now seen corresponding path program 1 times [2021-03-11 20:29:55,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:55,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503735460] [2021-03-11 20:29:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:55,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:55,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:29:55,749 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-11 20:29:55,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503735460] [2021-03-11 20:29:55,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:55,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:29:55,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475624842] [2021-03-11 20:29:55,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:29:55,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:29:55,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:29:55,751 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 179 [2021-03-11 20:29:55,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-11 20:29:55,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:55,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 179 [2021-03-11 20:29:55,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:55,766 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-11 20:29:55,767 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-11 20:29:55,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 31 events. 3/31 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-11 20:29:55,767 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-11 20:29:55,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 73 flow [2021-03-11 20:29:55,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:29:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:29:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-11 20:29:55,769 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8566108007448789 [2021-03-11 20:29:55,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-11 20:29:55,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-11 20:29:55,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:55,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-11 20:29:55,771 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-11 20:29:55,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:55,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:55,772 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 460 transitions. [2021-03-11 20:29:55,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 73 flow [2021-03-11 20:29:55,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:29:55,773 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-11 20:29:55,773 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-11 20:29:55,774 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2021-03-11 20:29:55,774 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-11 20:29:55,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-11 20:29:55,774 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:55,774 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:55,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:29:55,774 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -857700261, now seen corresponding path program 1 times [2021-03-11 20:29:55,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:55,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803213159] [2021-03-11 20:29:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:55,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:55,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:55,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:55,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:55,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:55,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:55,952 INFO L142 QuantifierPusher]: treesize reduction 22, result has 73.5 percent of original size [2021-03-11 20:29:55,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-11 20:29:55,986 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-11 20:29:55,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-11 20:29:56,012 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-11 20:29:56,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803213159] [2021-03-11 20:29:56,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:56,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:29:56,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941542614] [2021-03-11 20:29:56,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:29:56,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:29:56,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:29:56,015 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 179 [2021-03-11 20:29:56,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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-11 20:29:56,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:56,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 179 [2021-03-11 20:29:56,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:56,191 INFO L129 PetriNetUnfolder]: 143/306 cut-off events. [2021-03-11 20:29:56,191 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2021-03-11 20:29:56,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 306 events. 143/306 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1494 event pairs, 24 based on Foata normal form. 4/306 useless extension candidates. Maximal degree in co-relation 629. Up to 174 conditions per place. [2021-03-11 20:29:56,197 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 14 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2021-03-11 20:29:56,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 135 flow [2021-03-11 20:29:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:29:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:29:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2021-03-11 20:29:56,201 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7108938547486033 [2021-03-11 20:29:56,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2021-03-11 20:29:56,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2021-03-11 20:29:56,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:56,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2021-03-11 20:29:56,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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-11 20:29:56,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:29:56,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:29:56,206 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 4 states and 509 transitions. [2021-03-11 20:29:56,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 135 flow [2021-03-11 20:29:56,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:29:56,208 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 105 flow [2021-03-11 20:29:56,208 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-11 20:29:56,208 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2021-03-11 20:29:56,208 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 105 flow [2021-03-11 20:29:56,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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-11 20:29:56,209 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:56,209 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:56,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:29:56,209 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash -818907690, now seen corresponding path program 1 times [2021-03-11 20:29:56,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:56,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599029875] [2021-03-11 20:29:56,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:56,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:29:56,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:29:56,376 INFO L142 QuantifierPusher]: treesize reduction 29, result has 58.0 percent of original size [2021-03-11 20:29:56,378 INFO L147 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size 32 [2021-03-11 20:29:56,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:29:56,416 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.8 percent of original size [2021-03-11 20:29:56,418 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.3 percent of original size 39 [2021-03-11 20:29:56,452 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-11 20:29:56,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599029875] [2021-03-11 20:29:56,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:56,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:29:56,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956808150] [2021-03-11 20:29:56,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:29:56,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:29:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:29:56,456 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 179 [2021-03-11 20:29:56,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 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-11 20:29:56,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:56,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 179 [2021-03-11 20:29:56,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:56,691 INFO L129 PetriNetUnfolder]: 159/330 cut-off events. [2021-03-11 20:29:56,691 INFO L130 PetriNetUnfolder]: For 190/215 co-relation queries the response was YES. [2021-03-11 20:29:56,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 330 events. 159/330 cut-off events. For 190/215 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1589 event pairs, 13 based on Foata normal form. 9/334 useless extension candidates. Maximal degree in co-relation 807. Up to 183 conditions per place. [2021-03-11 20:29:56,694 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 18 selfloop transitions, 13 changer transitions 0/44 dead transitions. [2021-03-11 20:29:56,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 220 flow [2021-03-11 20:29:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:29:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:29:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2021-03-11 20:29:56,697 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.686219739292365 [2021-03-11 20:29:56,697 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2021-03-11 20:29:56,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2021-03-11 20:29:56,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:56,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2021-03-11 20:29:56,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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-11 20:29:56,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:56,702 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:56,703 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 105 flow. Second operand 6 states and 737 transitions. [2021-03-11 20:29:56,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 220 flow [2021-03-11 20:29:56,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:29:56,705 INFO L241 Difference]: Finished difference. Result has 43 places, 36 transitions, 187 flow [2021-03-11 20:29:56,706 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2021-03-11 20:29:56,706 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2021-03-11 20:29:56,706 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 187 flow [2021-03-11 20:29:56,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 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-11 20:29:56,706 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:56,706 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:56,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:29:56,707 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1956224412, now seen corresponding path program 2 times [2021-03-11 20:29:56,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:56,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345664539] [2021-03-11 20:29:56,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:56,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:56,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:29:56,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-11 20:29:56,867 INFO L142 QuantifierPusher]: treesize reduction 8, result has 68.0 percent of original size [2021-03-11 20:29:56,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:29:56,883 INFO L142 QuantifierPusher]: treesize reduction 13, result has 59.4 percent of original size [2021-03-11 20:29:56,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:29:56,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:56,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 20:29:56,911 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-11 20:29:56,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345664539] [2021-03-11 20:29:56,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:56,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:29:56,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282096514] [2021-03-11 20:29:56,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:29:56,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:29:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:29:56,915 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 179 [2021-03-11 20:29:56,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 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-11 20:29:56,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:56,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 179 [2021-03-11 20:29:56,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:57,130 INFO L129 PetriNetUnfolder]: 193/393 cut-off events. [2021-03-11 20:29:57,130 INFO L130 PetriNetUnfolder]: For 535/587 co-relation queries the response was YES. [2021-03-11 20:29:57,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 393 events. 193/393 cut-off events. For 535/587 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2076 event pairs, 16 based on Foata normal form. 17/401 useless extension candidates. Maximal degree in co-relation 1266. Up to 200 conditions per place. [2021-03-11 20:29:57,135 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 21 selfloop transitions, 22 changer transitions 0/56 dead transitions. [2021-03-11 20:29:57,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 374 flow [2021-03-11 20:29:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:29:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:29:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 776 transitions. [2021-03-11 20:29:57,138 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7225325884543762 [2021-03-11 20:29:57,138 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 776 transitions. [2021-03-11 20:29:57,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 776 transitions. [2021-03-11 20:29:57,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:57,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 776 transitions. [2021-03-11 20:29:57,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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-11 20:29:57,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:57,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:57,142 INFO L185 Difference]: Start difference. First operand has 43 places, 36 transitions, 187 flow. Second operand 6 states and 776 transitions. [2021-03-11 20:29:57,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 374 flow [2021-03-11 20:29:57,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 361 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-11 20:29:57,148 INFO L241 Difference]: Finished difference. Result has 49 places, 51 transitions, 325 flow [2021-03-11 20:29:57,148 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2021-03-11 20:29:57,148 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2021-03-11 20:29:57,148 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 325 flow [2021-03-11 20:29:57,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 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-11 20:29:57,149 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:57,149 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:57,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:29:57,149 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1245390226, now seen corresponding path program 3 times [2021-03-11 20:29:57,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:57,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547365603] [2021-03-11 20:29:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:57,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:57,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:57,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:29:57,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:29:57,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:29:57,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:29:57,316 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-11 20:29:57,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547365603] [2021-03-11 20:29:57,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:57,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:29:57,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921026663] [2021-03-11 20:29:57,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:29:57,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:29:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:29:57,318 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 179 [2021-03-11 20:29:57,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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-11 20:29:57,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:57,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 179 [2021-03-11 20:29:57,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:57,564 INFO L129 PetriNetUnfolder]: 240/496 cut-off events. [2021-03-11 20:29:57,564 INFO L130 PetriNetUnfolder]: For 1075/1155 co-relation queries the response was YES. [2021-03-11 20:29:57,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 496 events. 240/496 cut-off events. For 1075/1155 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2716 event pairs, 9 based on Foata normal form. 33/524 useless extension candidates. Maximal degree in co-relation 1969. Up to 266 conditions per place. [2021-03-11 20:29:57,569 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 54 selfloop transitions, 29 changer transitions 0/96 dead transitions. [2021-03-11 20:29:57,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 822 flow [2021-03-11 20:29:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:29:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:29:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2021-03-11 20:29:57,572 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7160148975791434 [2021-03-11 20:29:57,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2021-03-11 20:29:57,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2021-03-11 20:29:57,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:57,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2021-03-11 20:29:57,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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-11 20:29:57,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:57,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:57,576 INFO L185 Difference]: Start difference. First operand has 49 places, 51 transitions, 325 flow. Second operand 6 states and 769 transitions. [2021-03-11 20:29:57,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 822 flow [2021-03-11 20:29:57,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 810 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-11 20:29:57,584 INFO L241 Difference]: Finished difference. Result has 56 places, 71 transitions, 573 flow [2021-03-11 20:29:57,584 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=56, PETRI_TRANSITIONS=71} [2021-03-11 20:29:57,584 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2021-03-11 20:29:57,584 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 71 transitions, 573 flow [2021-03-11 20:29:57,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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-11 20:29:57,585 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:57,585 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:57,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:29:57,585 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:57,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1150346903, now seen corresponding path program 1 times [2021-03-11 20:29:57,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:57,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131790407] [2021-03-11 20:29:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:57,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:29:57,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:29:57,659 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-11 20:29:57,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131790407] [2021-03-11 20:29:57,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:57,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:29:57,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426522175] [2021-03-11 20:29:57,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:29:57,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:29:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:29:57,662 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-11 20:29:57,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 71 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:29:57,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:57,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-11 20:29:57,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:57,767 INFO L129 PetriNetUnfolder]: 223/544 cut-off events. [2021-03-11 20:29:57,767 INFO L130 PetriNetUnfolder]: For 1661/1760 co-relation queries the response was YES. [2021-03-11 20:29:57,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 544 events. 223/544 cut-off events. For 1661/1760 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3484 event pairs, 15 based on Foata normal form. 35/570 useless extension candidates. Maximal degree in co-relation 2149. Up to 228 conditions per place. [2021-03-11 20:29:57,773 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 4 selfloop transitions, 3 changer transitions 5/71 dead transitions. [2021-03-11 20:29:57,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 587 flow [2021-03-11 20:29:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:29:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:29:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-11 20:29:57,775 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8547486033519553 [2021-03-11 20:29:57,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-11 20:29:57,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-11 20:29:57,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:57,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-11 20:29:57,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:29:57,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:57,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 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-11 20:29:57,778 INFO L185 Difference]: Start difference. First operand has 56 places, 71 transitions, 573 flow. Second operand 3 states and 459 transitions. [2021-03-11 20:29:57,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 587 flow [2021-03-11 20:29:57,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:29:57,784 INFO L241 Difference]: Finished difference. Result has 58 places, 66 transitions, 528 flow [2021-03-11 20:29:57,784 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2021-03-11 20:29:57,784 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2021-03-11 20:29:57,784 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 528 flow [2021-03-11 20:29:57,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:29:57,784 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:57,784 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:57,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:29:57,785 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1991834844, now seen corresponding path program 1 times [2021-03-11 20:29:57,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:57,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145640308] [2021-03-11 20:29:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:57,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:29:57,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:57,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:57,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:29:57,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:57,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:57,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:29:57,975 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-11 20:29:57,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145640308] [2021-03-11 20:29:57,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:57,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:29:57,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601968985] [2021-03-11 20:29:57,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:29:57,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:57,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:29:57,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:29:57,977 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 179 [2021-03-11 20:29:57,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 528 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 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-11 20:29:57,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:57,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 179 [2021-03-11 20:29:57,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:58,218 INFO L129 PetriNetUnfolder]: 296/696 cut-off events. [2021-03-11 20:29:58,219 INFO L130 PetriNetUnfolder]: For 2981/3175 co-relation queries the response was YES. [2021-03-11 20:29:58,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 696 events. 296/696 cut-off events. For 2981/3175 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4715 event pairs, 34 based on Foata normal form. 89/778 useless extension candidates. Maximal degree in co-relation 3237. Up to 319 conditions per place. [2021-03-11 20:29:58,225 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 34 selfloop transitions, 22 changer transitions 27/96 dead transitions. [2021-03-11 20:29:58,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 96 transitions, 936 flow [2021-03-11 20:29:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:29:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:29:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2021-03-11 20:29:58,228 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7150837988826816 [2021-03-11 20:29:58,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2021-03-11 20:29:58,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2021-03-11 20:29:58,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:58,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2021-03-11 20:29:58,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 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-11 20:29:58,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-11 20:29:58,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-11 20:29:58,231 INFO L185 Difference]: Start difference. First operand has 58 places, 66 transitions, 528 flow. Second operand 5 states and 640 transitions. [2021-03-11 20:29:58,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 96 transitions, 936 flow [2021-03-11 20:29:58,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 931 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:29:58,238 INFO L241 Difference]: Finished difference. Result has 64 places, 59 transitions, 549 flow [2021-03-11 20:29:58,238 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2021-03-11 20:29:58,238 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2021-03-11 20:29:58,238 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 549 flow [2021-03-11 20:29:58,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 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-11 20:29:58,238 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:58,239 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:58,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:29:58,239 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash -785542612, now seen corresponding path program 2 times [2021-03-11 20:29:58,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:58,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576801302] [2021-03-11 20:29:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:58,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:29:58,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:29:58,328 INFO L142 QuantifierPusher]: treesize reduction 7, result has 75.0 percent of original size [2021-03-11 20:29:58,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:29:58,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:29:58,351 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-11 20:29:58,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576801302] [2021-03-11 20:29:58,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:58,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:29:58,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129106922] [2021-03-11 20:29:58,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:29:58,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:29:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:29:58,356 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 179 [2021-03-11 20:29:58,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 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-11 20:29:58,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:58,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 179 [2021-03-11 20:29:58,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:58,605 INFO L129 PetriNetUnfolder]: 260/630 cut-off events. [2021-03-11 20:29:58,605 INFO L130 PetriNetUnfolder]: For 3475/3610 co-relation queries the response was YES. [2021-03-11 20:29:58,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 630 events. 260/630 cut-off events. For 3475/3610 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4250 event pairs, 40 based on Foata normal form. 54/682 useless extension candidates. Maximal degree in co-relation 3290. Up to 406 conditions per place. [2021-03-11 20:29:58,610 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 33 selfloop transitions, 24 changer transitions 2/72 dead transitions. [2021-03-11 20:29:58,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 801 flow [2021-03-11 20:29:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:29:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:29:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 753 transitions. [2021-03-11 20:29:58,613 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7011173184357542 [2021-03-11 20:29:58,613 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 753 transitions. [2021-03-11 20:29:58,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 753 transitions. [2021-03-11 20:29:58,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:58,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 753 transitions. [2021-03-11 20:29:58,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 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-11 20:29:58,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:58,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:29:58,617 INFO L185 Difference]: Start difference. First operand has 64 places, 59 transitions, 549 flow. Second operand 6 states and 753 transitions. [2021-03-11 20:29:58,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 801 flow [2021-03-11 20:29:58,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 72 transitions, 766 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-11 20:29:58,623 INFO L241 Difference]: Finished difference. Result has 68 places, 65 transitions, 664 flow [2021-03-11 20:29:58,624 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=664, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2021-03-11 20:29:58,624 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2021-03-11 20:29:58,624 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 664 flow [2021-03-11 20:29:58,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 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-11 20:29:58,625 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:58,625 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:58,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:29:58,625 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:58,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1605321478, now seen corresponding path program 3 times [2021-03-11 20:29:58,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:58,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584735709] [2021-03-11 20:29:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:58,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:58,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:58,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:29:58,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:29:58,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:58,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:29:58,777 INFO L142 QuantifierPusher]: treesize reduction 6, result has 71.4 percent of original size [2021-03-11 20:29:58,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:29:58,790 INFO L142 QuantifierPusher]: treesize reduction 6, result has 75.0 percent of original size [2021-03-11 20:29:58,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:29:58,808 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-11 20:29:58,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584735709] [2021-03-11 20:29:58,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:58,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:29:58,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985488787] [2021-03-11 20:29:58,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:29:58,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:29:58,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:29:58,810 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 179 [2021-03-11 20:29:58,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 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-11 20:29:58,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:58,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 179 [2021-03-11 20:29:58,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:59,171 INFO L129 PetriNetUnfolder]: 269/657 cut-off events. [2021-03-11 20:29:59,171 INFO L130 PetriNetUnfolder]: For 4053/4163 co-relation queries the response was YES. [2021-03-11 20:29:59,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3593 conditions, 657 events. 269/657 cut-off events. For 4053/4163 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4535 event pairs, 18 based on Foata normal form. 60/713 useless extension candidates. Maximal degree in co-relation 3562. Up to 409 conditions per place. [2021-03-11 20:29:59,177 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 36 selfloop transitions, 32 changer transitions 1/82 dead transitions. [2021-03-11 20:29:59,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 964 flow [2021-03-11 20:29:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 20:29:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 20:29:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1224 transitions. [2021-03-11 20:29:59,181 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6837988826815642 [2021-03-11 20:29:59,181 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1224 transitions. [2021-03-11 20:29:59,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1224 transitions. [2021-03-11 20:29:59,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:59,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1224 transitions. [2021-03-11 20:29:59,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.4) internal successors, (1224), 10 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:29:59,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 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-11 20:29:59,186 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 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-11 20:29:59,186 INFO L185 Difference]: Start difference. First operand has 68 places, 65 transitions, 664 flow. Second operand 10 states and 1224 transitions. [2021-03-11 20:29:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 964 flow [2021-03-11 20:29:59,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 82 transitions, 955 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:29:59,250 INFO L241 Difference]: Finished difference. Result has 77 places, 72 transitions, 823 flow [2021-03-11 20:29:59,250 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=823, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2021-03-11 20:29:59,250 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2021-03-11 20:29:59,250 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 823 flow [2021-03-11 20:29:59,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 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-11 20:29:59,251 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:59,251 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:59,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:29:59,251 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 91400068, now seen corresponding path program 4 times [2021-03-11 20:29:59,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:59,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670019571] [2021-03-11 20:29:59,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:59,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:29:59,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:59,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:29:59,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:29:59,381 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-11 20:29:59,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670019571] [2021-03-11 20:29:59,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:59,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:29:59,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327195771] [2021-03-11 20:29:59,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:29:59,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:59,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:29:59,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:29:59,383 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 179 [2021-03-11 20:29:59,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 823 flow. Second operand has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 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-11 20:29:59,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:59,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 179 [2021-03-11 20:29:59,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:29:59,757 INFO L129 PetriNetUnfolder]: 305/789 cut-off events. [2021-03-11 20:29:59,757 INFO L130 PetriNetUnfolder]: For 6568/6666 co-relation queries the response was YES. [2021-03-11 20:29:59,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4664 conditions, 789 events. 305/789 cut-off events. For 6568/6666 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5868 event pairs, 4 based on Foata normal form. 39/812 useless extension candidates. Maximal degree in co-relation 4631. Up to 355 conditions per place. [2021-03-11 20:29:59,764 INFO L132 encePairwiseOnDemand]: 169/179 looper letters, 55 selfloop transitions, 48 changer transitions 23/139 dead transitions. [2021-03-11 20:29:59,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 1926 flow [2021-03-11 20:29:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:29:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:29:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1105 transitions. [2021-03-11 20:29:59,767 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.685909373060211 [2021-03-11 20:29:59,767 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1105 transitions. [2021-03-11 20:29:59,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1105 transitions. [2021-03-11 20:29:59,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:29:59,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1105 transitions. [2021-03-11 20:29:59,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.77777777777777) internal successors, (1105), 9 states have internal predecessors, (1105), 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-11 20:29:59,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 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-11 20:29:59,773 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 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-11 20:29:59,773 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 823 flow. Second operand 9 states and 1105 transitions. [2021-03-11 20:29:59,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 1926 flow [2021-03-11 20:29:59,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 139 transitions, 1734 flow, removed 40 selfloop flow, removed 7 redundant places. [2021-03-11 20:29:59,787 INFO L241 Difference]: Finished difference. Result has 83 places, 107 transitions, 1376 flow [2021-03-11 20:29:59,787 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1376, PETRI_PLACES=83, PETRI_TRANSITIONS=107} [2021-03-11 20:29:59,788 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2021-03-11 20:29:59,788 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 1376 flow [2021-03-11 20:29:59,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 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-11 20:29:59,788 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:29:59,788 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:29:59,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:29:59,789 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:29:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:29:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1560675862, now seen corresponding path program 5 times [2021-03-11 20:29:59,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:29:59,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063112214] [2021-03-11 20:29:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:29:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:29:59,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:29:59,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:59,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:29:59,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:29:59,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:29:59,872 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-11 20:29:59,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063112214] [2021-03-11 20:29:59,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:29:59,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:29:59,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782035439] [2021-03-11 20:29:59,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:29:59,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:29:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:29:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:29:59,875 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 179 [2021-03-11 20:29:59,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 107 transitions, 1376 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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-11 20:29:59,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:29:59,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 179 [2021-03-11 20:29:59,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:00,061 INFO L129 PetriNetUnfolder]: 238/645 cut-off events. [2021-03-11 20:30:00,062 INFO L130 PetriNetUnfolder]: For 7211/7346 co-relation queries the response was YES. [2021-03-11 20:30:00,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4330 conditions, 645 events. 238/645 cut-off events. For 7211/7346 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4652 event pairs, 25 based on Foata normal form. 37/664 useless extension candidates. Maximal degree in co-relation 4293. Up to 374 conditions per place. [2021-03-11 20:30:00,068 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 66 selfloop transitions, 34 changer transitions 7/120 dead transitions. [2021-03-11 20:30:00,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 120 transitions, 1748 flow [2021-03-11 20:30:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:30:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:30:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2021-03-11 20:30:00,070 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7360335195530726 [2021-03-11 20:30:00,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2021-03-11 20:30:00,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2021-03-11 20:30:00,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:00,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2021-03-11 20:30:00,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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-11 20:30:00,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:00,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:00,073 INFO L185 Difference]: Start difference. First operand has 83 places, 107 transitions, 1376 flow. Second operand 4 states and 527 transitions. [2021-03-11 20:30:00,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 120 transitions, 1748 flow [2021-03-11 20:30:00,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 120 transitions, 1655 flow, removed 40 selfloop flow, removed 2 redundant places. [2021-03-11 20:30:00,093 INFO L241 Difference]: Finished difference. Result has 85 places, 108 transitions, 1411 flow [2021-03-11 20:30:00,094 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1411, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2021-03-11 20:30:00,094 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2021-03-11 20:30:00,094 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 1411 flow [2021-03-11 20:30:00,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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-11 20:30:00,095 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:00,095 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:30:00,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:30:00,095 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash 822831214, now seen corresponding path program 1 times [2021-03-11 20:30:00,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:00,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555479887] [2021-03-11 20:30:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:00,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:30:00,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:30:00,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:30:00,222 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-11 20:30:00,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-11 20:30:00,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:30:00,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:30:00,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:30:00,304 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-11 20:30:00,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555479887] [2021-03-11 20:30:00,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:00,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:30:00,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439762709] [2021-03-11 20:30:00,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:30:00,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:00,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:30:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:30:00,307 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 179 [2021-03-11 20:30:00,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 1411 flow. Second operand has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 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-11 20:30:00,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:00,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 179 [2021-03-11 20:30:00,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:00,769 INFO L129 PetriNetUnfolder]: 278/762 cut-off events. [2021-03-11 20:30:00,769 INFO L130 PetriNetUnfolder]: For 9244/9412 co-relation queries the response was YES. [2021-03-11 20:30:00,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 762 events. 278/762 cut-off events. For 9244/9412 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5813 event pairs, 4 based on Foata normal form. 55/795 useless extension candidates. Maximal degree in co-relation 5110. Up to 319 conditions per place. [2021-03-11 20:30:00,776 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 77 selfloop transitions, 35 changer transitions 22/147 dead transitions. [2021-03-11 20:30:00,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 147 transitions, 2240 flow [2021-03-11 20:30:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:30:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:30:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2021-03-11 20:30:00,780 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6536312849162011 [2021-03-11 20:30:00,780 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2021-03-11 20:30:00,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2021-03-11 20:30:00,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:00,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2021-03-11 20:30:00,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-11 20:30:00,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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-11 20:30:00,785 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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-11 20:30:00,785 INFO L185 Difference]: Start difference. First operand has 85 places, 108 transitions, 1411 flow. Second operand 8 states and 936 transitions. [2021-03-11 20:30:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 147 transitions, 2240 flow [2021-03-11 20:30:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 147 transitions, 2209 flow, removed 15 selfloop flow, removed 1 redundant places. [2021-03-11 20:30:00,809 INFO L241 Difference]: Finished difference. Result has 94 places, 111 transitions, 1574 flow [2021-03-11 20:30:00,809 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1574, PETRI_PLACES=94, PETRI_TRANSITIONS=111} [2021-03-11 20:30:00,809 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 61 predicate places. [2021-03-11 20:30:00,809 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 111 transitions, 1574 flow [2021-03-11 20:30:00,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 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-11 20:30:00,810 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:00,810 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:30:00,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:30:00,810 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1879307626, now seen corresponding path program 2 times [2021-03-11 20:30:00,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:00,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619606498] [2021-03-11 20:30:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:00,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:30:00,899 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-11 20:30:00,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-11 20:30:00,926 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.5 percent of original size [2021-03-11 20:30:00,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-11 20:30:00,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-11 20:30:00,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:00,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-11 20:30:01,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:30:01,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:30:01,046 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-11 20:30:01,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619606498] [2021-03-11 20:30:01,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:01,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 20:30:01,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917123869] [2021-03-11 20:30:01,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 20:30:01,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 20:30:01,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-11 20:30:01,049 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 179 [2021-03-11 20:30:01,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 111 transitions, 1574 flow. Second operand has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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-11 20:30:01,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:01,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 179 [2021-03-11 20:30:01,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:01,496 INFO L129 PetriNetUnfolder]: 208/633 cut-off events. [2021-03-11 20:30:01,496 INFO L130 PetriNetUnfolder]: For 8997/9209 co-relation queries the response was YES. [2021-03-11 20:30:01,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 633 events. 208/633 cut-off events. For 8997/9209 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4798 event pairs, 1 based on Foata normal form. 91/704 useless extension candidates. Maximal degree in co-relation 4397. Up to 252 conditions per place. [2021-03-11 20:30:01,503 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 48 selfloop transitions, 44 changer transitions 29/134 dead transitions. [2021-03-11 20:30:01,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 134 transitions, 2167 flow [2021-03-11 20:30:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:30:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:30:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1295 transitions. [2021-03-11 20:30:01,507 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6576942610462163 [2021-03-11 20:30:01,507 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1295 transitions. [2021-03-11 20:30:01,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1295 transitions. [2021-03-11 20:30:01,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:01,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1295 transitions. [2021-03-11 20:30:01,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.72727272727273) internal successors, (1295), 11 states have internal predecessors, (1295), 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-11 20:30:01,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 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-11 20:30:01,513 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 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-11 20:30:01,513 INFO L185 Difference]: Start difference. First operand has 94 places, 111 transitions, 1574 flow. Second operand 11 states and 1295 transitions. [2021-03-11 20:30:01,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 134 transitions, 2167 flow [2021-03-11 20:30:01,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 134 transitions, 2132 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-11 20:30:01,536 INFO L241 Difference]: Finished difference. Result has 103 places, 97 transitions, 1403 flow [2021-03-11 20:30:01,536 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1403, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2021-03-11 20:30:01,536 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2021-03-11 20:30:01,536 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 1403 flow [2021-03-11 20:30:01,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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-11 20:30:01,548 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:01,549 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:30:01,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:30:01,549 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash 443476535, now seen corresponding path program 1 times [2021-03-11 20:30:01,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:01,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141913161] [2021-03-11 20:30:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:01,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:01,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:30:01,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:30:01,615 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-11 20:30:01,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141913161] [2021-03-11 20:30:01,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:01,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:30:01,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607955629] [2021-03-11 20:30:01,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:30:01,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:30:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:30:01,617 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 179 [2021-03-11 20:30:01,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 1403 flow. Second operand has 4 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-11 20:30:01,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:01,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 179 [2021-03-11 20:30:01,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:01,739 INFO L129 PetriNetUnfolder]: 268/650 cut-off events. [2021-03-11 20:30:01,739 INFO L130 PetriNetUnfolder]: For 8406/8603 co-relation queries the response was YES. [2021-03-11 20:30:01,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3250 conditions, 650 events. 268/650 cut-off events. For 8406/8603 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4423 event pairs, 80 based on Foata normal form. 193/810 useless extension candidates. Maximal degree in co-relation 3206. Up to 346 conditions per place. [2021-03-11 20:30:01,745 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 13 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2021-03-11 20:30:01,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 85 transitions, 1146 flow [2021-03-11 20:30:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:30:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:30:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2021-03-11 20:30:01,748 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8245810055865922 [2021-03-11 20:30:01,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2021-03-11 20:30:01,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2021-03-11 20:30:01,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:01,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2021-03-11 20:30:01,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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-11 20:30:01,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-11 20:30:01,754 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 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-11 20:30:01,754 INFO L185 Difference]: Start difference. First operand has 103 places, 97 transitions, 1403 flow. Second operand 5 states and 738 transitions. [2021-03-11 20:30:01,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 85 transitions, 1146 flow [2021-03-11 20:30:01,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 1041 flow, removed 22 selfloop flow, removed 14 redundant places. [2021-03-11 20:30:01,769 INFO L241 Difference]: Finished difference. Result has 94 places, 82 transitions, 1059 flow [2021-03-11 20:30:01,770 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1059, PETRI_PLACES=94, PETRI_TRANSITIONS=82} [2021-03-11 20:30:01,770 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 61 predicate places. [2021-03-11 20:30:01,770 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 82 transitions, 1059 flow [2021-03-11 20:30:01,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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-11 20:30:01,770 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:01,770 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:30:01,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 20:30:01,770 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1720809927, now seen corresponding path program 1 times [2021-03-11 20:30:01,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:01,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680963381] [2021-03-11 20:30:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:01,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:01,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:01,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:30:01,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:01,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:30:01,844 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-11 20:30:01,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680963381] [2021-03-11 20:30:01,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:01,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:30:01,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920889129] [2021-03-11 20:30:01,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:30:01,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:01,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:30:01,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:30:01,847 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 179 [2021-03-11 20:30:01,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 1059 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:01,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:01,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 179 [2021-03-11 20:30:01,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:01,952 INFO L129 PetriNetUnfolder]: 151/464 cut-off events. [2021-03-11 20:30:01,952 INFO L130 PetriNetUnfolder]: For 5692/6429 co-relation queries the response was YES. [2021-03-11 20:30:01,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 464 events. 151/464 cut-off events. For 5692/6429 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3243 event pairs, 10 based on Foata normal form. 389/830 useless extension candidates. Maximal degree in co-relation 2403. Up to 273 conditions per place. [2021-03-11 20:30:01,956 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 6 selfloop transitions, 15 changer transitions 3/84 dead transitions. [2021-03-11 20:30:01,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 84 transitions, 1065 flow [2021-03-11 20:30:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:30:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:30:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2021-03-11 20:30:01,960 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8244213886671987 [2021-03-11 20:30:01,960 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions. [2021-03-11 20:30:01,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions. [2021-03-11 20:30:01,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:01,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions. [2021-03-11 20:30:01,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 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-11 20:30:01,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 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-11 20:30:01,964 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 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-11 20:30:01,964 INFO L185 Difference]: Start difference. First operand has 94 places, 82 transitions, 1059 flow. Second operand 7 states and 1033 transitions. [2021-03-11 20:30:01,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 84 transitions, 1065 flow [2021-03-11 20:30:01,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 84 transitions, 1003 flow, removed 17 selfloop flow, removed 4 redundant places. [2021-03-11 20:30:01,976 INFO L241 Difference]: Finished difference. Result has 99 places, 81 transitions, 1000 flow [2021-03-11 20:30:01,976 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1000, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2021-03-11 20:30:01,976 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2021-03-11 20:30:01,976 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 1000 flow [2021-03-11 20:30:01,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:01,977 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:01,977 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:30:01,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 20:30:01,978 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -242938297, now seen corresponding path program 1 times [2021-03-11 20:30:01,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:01,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425620577] [2021-03-11 20:30:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:02,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:02,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:02,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:02,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:30:02,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:30:02,071 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-11 20:30:02,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425620577] [2021-03-11 20:30:02,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:02,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:30:02,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160405091] [2021-03-11 20:30:02,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:30:02,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:02,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:30:02,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:30:02,074 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 179 [2021-03-11 20:30:02,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 1000 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 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-11 20:30:02,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:02,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 179 [2021-03-11 20:30:02,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:02,224 INFO L129 PetriNetUnfolder]: 108/388 cut-off events. [2021-03-11 20:30:02,224 INFO L130 PetriNetUnfolder]: For 5235/6095 co-relation queries the response was YES. [2021-03-11 20:30:02,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 388 events. 108/388 cut-off events. For 5235/6095 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2818 event pairs, 0 based on Foata normal form. 329/696 useless extension candidates. Maximal degree in co-relation 2224. Up to 236 conditions per place. [2021-03-11 20:30:02,228 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 2 selfloop transitions, 19 changer transitions 12/83 dead transitions. [2021-03-11 20:30:02,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 83 transitions, 1047 flow [2021-03-11 20:30:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:30:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:30:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1322 transitions. [2021-03-11 20:30:02,232 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8206083178150217 [2021-03-11 20:30:02,232 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1322 transitions. [2021-03-11 20:30:02,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1322 transitions. [2021-03-11 20:30:02,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:02,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1322 transitions. [2021-03-11 20:30:02,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 146.88888888888889) internal successors, (1322), 9 states have internal predecessors, (1322), 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-11 20:30:02,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 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-11 20:30:02,238 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 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-11 20:30:02,238 INFO L185 Difference]: Start difference. First operand has 99 places, 81 transitions, 1000 flow. Second operand 9 states and 1322 transitions. [2021-03-11 20:30:02,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 83 transitions, 1047 flow [2021-03-11 20:30:02,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 83 transitions, 941 flow, removed 25 selfloop flow, removed 5 redundant places. [2021-03-11 20:30:02,251 INFO L241 Difference]: Finished difference. Result has 105 places, 71 transitions, 833 flow [2021-03-11 20:30:02,252 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=833, PETRI_PLACES=105, PETRI_TRANSITIONS=71} [2021-03-11 20:30:02,252 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 72 predicate places. [2021-03-11 20:30:02,252 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 71 transitions, 833 flow [2021-03-11 20:30:02,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 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-11 20:30:02,252 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:02,253 INFO L255 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-11 20:30:02,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 20:30:02,253 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1302215730, now seen corresponding path program 1 times [2021-03-11 20:30:02,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:02,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174455327] [2021-03-11 20:30:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:02,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:30:02,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:30:02,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-11 20:30:02,381 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size [2021-03-11 20:30:02,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 20:30:02,401 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-03-11 20:30:02,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:30:02,420 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-11 20:30:02,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174455327] [2021-03-11 20:30:02,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:02,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:30:02,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541859356] [2021-03-11 20:30:02,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:30:02,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:30:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:30:02,423 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 179 [2021-03-11 20:30:02,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 71 transitions, 833 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-11 20:30:02,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:02,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 179 [2021-03-11 20:30:02,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:02,642 INFO L129 PetriNetUnfolder]: 57/234 cut-off events. [2021-03-11 20:30:02,642 INFO L130 PetriNetUnfolder]: For 2446/2519 co-relation queries the response was YES. [2021-03-11 20:30:02,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 234 events. 57/234 cut-off events. For 2446/2519 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1481 event pairs, 0 based on Foata normal form. 31/256 useless extension candidates. Maximal degree in co-relation 1188. Up to 65 conditions per place. [2021-03-11 20:30:02,644 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 24 selfloop transitions, 18 changer transitions 7/75 dead transitions. [2021-03-11 20:30:02,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 75 transitions, 991 flow [2021-03-11 20:30:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:30:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:30:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2021-03-11 20:30:02,647 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6536312849162011 [2021-03-11 20:30:02,647 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2021-03-11 20:30:02,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2021-03-11 20:30:02,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:02,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2021-03-11 20:30:02,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-11 20:30:02,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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-11 20:30:02,651 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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-11 20:30:02,651 INFO L185 Difference]: Start difference. First operand has 105 places, 71 transitions, 833 flow. Second operand 8 states and 936 transitions. [2021-03-11 20:30:02,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 75 transitions, 991 flow [2021-03-11 20:30:02,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 75 transitions, 911 flow, removed 16 selfloop flow, removed 14 redundant places. [2021-03-11 20:30:02,661 INFO L241 Difference]: Finished difference. Result has 100 places, 68 transitions, 786 flow [2021-03-11 20:30:02,661 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=786, PETRI_PLACES=100, PETRI_TRANSITIONS=68} [2021-03-11 20:30:02,661 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 67 predicate places. [2021-03-11 20:30:02,661 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 68 transitions, 786 flow [2021-03-11 20:30:02,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-11 20:30:02,661 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:02,662 INFO L255 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-11 20:30:02,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 20:30:02,662 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash -767634270, now seen corresponding path program 2 times [2021-03-11 20:30:02,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:02,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863866903] [2021-03-11 20:30:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:02,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:02,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:30:02,771 INFO L142 QuantifierPusher]: treesize reduction 15, result has 64.3 percent of original size [2021-03-11 20:30:02,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:30:02,797 INFO L142 QuantifierPusher]: treesize reduction 19, result has 66.1 percent of original size [2021-03-11 20:30:02,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-11 20:30:02,833 INFO L142 QuantifierPusher]: treesize reduction 31, result has 78.8 percent of original size [2021-03-11 20:30:02,837 INFO L147 QuantifierPusher]: treesize reduction 9, result has 92.2 percent of original size 106 [2021-03-11 20:30:02,906 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-03-11 20:30:02,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 20:30:02,918 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-11 20:30:02,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863866903] [2021-03-11 20:30:02,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:02,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:30:02,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060896717] [2021-03-11 20:30:02,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:30:02,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:30:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:30:02,920 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 179 [2021-03-11 20:30:02,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 68 transitions, 786 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-11 20:30:02,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:02,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 179 [2021-03-11 20:30:02,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:03,224 INFO L129 PetriNetUnfolder]: 60/242 cut-off events. [2021-03-11 20:30:03,225 INFO L130 PetriNetUnfolder]: For 1695/1749 co-relation queries the response was YES. [2021-03-11 20:30:03,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 242 events. 60/242 cut-off events. For 1695/1749 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1562 event pairs, 0 based on Foata normal form. 30/261 useless extension candidates. Maximal degree in co-relation 1095. Up to 70 conditions per place. [2021-03-11 20:30:03,227 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 22 selfloop transitions, 21 changer transitions 5/74 dead transitions. [2021-03-11 20:30:03,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 74 transitions, 966 flow [2021-03-11 20:30:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 20:30:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 20:30:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1167 transitions. [2021-03-11 20:30:03,230 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6519553072625698 [2021-03-11 20:30:03,230 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1167 transitions. [2021-03-11 20:30:03,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1167 transitions. [2021-03-11 20:30:03,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:03,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1167 transitions. [2021-03-11 20:30:03,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.7) internal successors, (1167), 10 states have internal predecessors, (1167), 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-11 20:30:03,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 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-11 20:30:03,235 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 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-11 20:30:03,235 INFO L185 Difference]: Start difference. First operand has 100 places, 68 transitions, 786 flow. Second operand 10 states and 1167 transitions. [2021-03-11 20:30:03,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 74 transitions, 966 flow [2021-03-11 20:30:03,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 74 transitions, 864 flow, removed 21 selfloop flow, removed 10 redundant places. [2021-03-11 20:30:03,244 INFO L241 Difference]: Finished difference. Result has 100 places, 69 transitions, 761 flow [2021-03-11 20:30:03,245 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=761, PETRI_PLACES=100, PETRI_TRANSITIONS=69} [2021-03-11 20:30:03,245 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 67 predicate places. [2021-03-11 20:30:03,245 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 69 transitions, 761 flow [2021-03-11 20:30:03,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 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-11 20:30:03,245 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:03,245 INFO L255 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-11 20:30:03,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-11 20:30:03,245 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1479203340, now seen corresponding path program 3 times [2021-03-11 20:30:03,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:03,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210478466] [2021-03-11 20:30:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:03,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:03,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:30:03,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:03,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:30:03,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:03,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:30:03,361 INFO L142 QuantifierPusher]: treesize reduction 3, result has 88.0 percent of original size [2021-03-11 20:30:03,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:30:03,379 INFO L142 QuantifierPusher]: treesize reduction 3, result has 91.2 percent of original size [2021-03-11 20:30:03,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-11 20:30:03,406 INFO L142 QuantifierPusher]: treesize reduction 3, result has 88.0 percent of original size [2021-03-11 20:30:03,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:30:03,423 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-11 20:30:03,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210478466] [2021-03-11 20:30:03,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:03,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:30:03,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537639085] [2021-03-11 20:30:03,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:30:03,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:03,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:30:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:30:03,426 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 179 [2021-03-11 20:30:03,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 69 transitions, 761 flow. Second operand has 8 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 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-11 20:30:03,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:03,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 179 [2021-03-11 20:30:03,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:03,703 INFO L129 PetriNetUnfolder]: 66/261 cut-off events. [2021-03-11 20:30:03,704 INFO L130 PetriNetUnfolder]: For 1517/1583 co-relation queries the response was YES. [2021-03-11 20:30:03,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 261 events. 66/261 cut-off events. For 1517/1583 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 1692 event pairs, 0 based on Foata normal form. 24/270 useless extension candidates. Maximal degree in co-relation 1148. Up to 80 conditions per place. [2021-03-11 20:30:03,706 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 10 selfloop transitions, 22 changer transitions 19/77 dead transitions. [2021-03-11 20:30:03,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 77 transitions, 976 flow [2021-03-11 20:30:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:30:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:30:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2021-03-11 20:30:03,711 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6687948922585794 [2021-03-11 20:30:03,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2021-03-11 20:30:03,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2021-03-11 20:30:03,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:03,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2021-03-11 20:30:03,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 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-11 20:30:03,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 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-11 20:30:03,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 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-11 20:30:03,719 INFO L185 Difference]: Start difference. First operand has 100 places, 69 transitions, 761 flow. Second operand 7 states and 838 transitions. [2021-03-11 20:30:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 77 transitions, 976 flow [2021-03-11 20:30:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 77 transitions, 881 flow, removed 25 selfloop flow, removed 9 redundant places. [2021-03-11 20:30:03,730 INFO L241 Difference]: Finished difference. Result has 96 places, 58 transitions, 574 flow [2021-03-11 20:30:03,730 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=96, PETRI_TRANSITIONS=58} [2021-03-11 20:30:03,730 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2021-03-11 20:30:03,730 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 58 transitions, 574 flow [2021-03-11 20:30:03,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.25) internal successors, (938), 8 states have internal predecessors, (938), 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-11 20:30:03,730 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:03,731 INFO L255 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-11 20:30:03,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-11 20:30:03,731 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 274596616, now seen corresponding path program 4 times [2021-03-11 20:30:03,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:03,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968321180] [2021-03-11 20:30:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:03,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:03,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:30:03,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:03,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:30:03,857 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.7 percent of original size [2021-03-11 20:30:03,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-11 20:30:03,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:03,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 20:30:03,908 INFO L142 QuantifierPusher]: treesize reduction 51, result has 59.8 percent of original size [2021-03-11 20:30:03,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2021-03-11 20:30:03,955 INFO L142 QuantifierPusher]: treesize reduction 78, result has 61.8 percent of original size [2021-03-11 20:30:03,958 INFO L147 QuantifierPusher]: treesize reduction 9, result has 92.9 percent of original size 117 [2021-03-11 20:30:04,031 INFO L142 QuantifierPusher]: treesize reduction 55, result has 62.3 percent of original size [2021-03-11 20:30:04,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2021-03-11 20:30:04,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:30:04,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:30:04,115 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-11 20:30:04,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968321180] [2021-03-11 20:30:04,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:04,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 20:30:04,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306256989] [2021-03-11 20:30:04,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 20:30:04,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 20:30:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-03-11 20:30:04,118 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 179 [2021-03-11 20:30:04,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 58 transitions, 574 flow. Second operand has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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-11 20:30:04,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:04,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 179 [2021-03-11 20:30:04,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:04,367 INFO L129 PetriNetUnfolder]: 48/192 cut-off events. [2021-03-11 20:30:04,367 INFO L130 PetriNetUnfolder]: For 958/1001 co-relation queries the response was YES. [2021-03-11 20:30:04,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 192 events. 48/192 cut-off events. For 958/1001 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1089 event pairs, 0 based on Foata normal form. 20/201 useless extension candidates. Maximal degree in co-relation 814. Up to 60 conditions per place. [2021-03-11 20:30:04,368 INFO L132 encePairwiseOnDemand]: 170/179 looper letters, 5 selfloop transitions, 19 changer transitions 10/60 dead transitions. [2021-03-11 20:30:04,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 60 transitions, 669 flow [2021-03-11 20:30:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:30:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:30:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 937 transitions. [2021-03-11 20:30:04,371 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6543296089385475 [2021-03-11 20:30:04,371 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 937 transitions. [2021-03-11 20:30:04,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 937 transitions. [2021-03-11 20:30:04,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:04,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 937 transitions. [2021-03-11 20:30:04,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 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-11 20:30:04,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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-11 20:30:04,375 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 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-11 20:30:04,375 INFO L185 Difference]: Start difference. First operand has 96 places, 58 transitions, 574 flow. Second operand 8 states and 937 transitions. [2021-03-11 20:30:04,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 60 transitions, 669 flow [2021-03-11 20:30:04,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 60 transitions, 581 flow, removed 8 selfloop flow, removed 15 redundant places. [2021-03-11 20:30:04,381 INFO L241 Difference]: Finished difference. Result has 85 places, 50 transitions, 459 flow [2021-03-11 20:30:04,381 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=459, PETRI_PLACES=85, PETRI_TRANSITIONS=50} [2021-03-11 20:30:04,381 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2021-03-11 20:30:04,381 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 50 transitions, 459 flow [2021-03-11 20:30:04,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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-11 20:30:04,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:04,382 INFO L255 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-11 20:30:04,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-11 20:30:04,382 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2028034780, now seen corresponding path program 5 times [2021-03-11 20:30:04,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:04,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859362513] [2021-03-11 20:30:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:04,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:04,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:30:04,469 INFO L142 QuantifierPusher]: treesize reduction 18, result has 79.3 percent of original size [2021-03-11 20:30:04,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-03-11 20:30:04,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:30:04,508 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-11 20:30:04,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859362513] [2021-03-11 20:30:04,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:04,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:30:04,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003837261] [2021-03-11 20:30:04,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:30:04,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:30:04,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:30:04,510 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 179 [2021-03-11 20:30:04,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 50 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:04,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:04,511 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 179 [2021-03-11 20:30:04,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:04,570 INFO L129 PetriNetUnfolder]: 35/140 cut-off events. [2021-03-11 20:30:04,570 INFO L130 PetriNetUnfolder]: For 595/626 co-relation queries the response was YES. [2021-03-11 20:30:04,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 140 events. 35/140 cut-off events. For 595/626 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 666 event pairs, 0 based on Foata normal form. 11/142 useless extension candidates. Maximal degree in co-relation 578. Up to 45 conditions per place. [2021-03-11 20:30:04,572 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 16 selfloop transitions, 2 changer transitions 12/54 dead transitions. [2021-03-11 20:30:04,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 54 transitions, 558 flow [2021-03-11 20:30:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:30:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:30:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2021-03-11 20:30:04,574 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7216014897579144 [2021-03-11 20:30:04,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2021-03-11 20:30:04,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2021-03-11 20:30:04,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:04,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2021-03-11 20:30:04,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 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-11 20:30:04,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:30:04,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:30:04,577 INFO L185 Difference]: Start difference. First operand has 85 places, 50 transitions, 459 flow. Second operand 6 states and 775 transitions. [2021-03-11 20:30:04,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 54 transitions, 558 flow [2021-03-11 20:30:04,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 54 transitions, 465 flow, removed 9 selfloop flow, removed 12 redundant places. [2021-03-11 20:30:04,581 INFO L241 Difference]: Finished difference. Result has 78 places, 42 transitions, 305 flow [2021-03-11 20:30:04,581 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=78, PETRI_TRANSITIONS=42} [2021-03-11 20:30:04,582 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2021-03-11 20:30:04,582 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 42 transitions, 305 flow [2021-03-11 20:30:04,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:04,582 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:04,582 INFO L255 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-11 20:30:04,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-11 20:30:04,582 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:04,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1454700776, now seen corresponding path program 6 times [2021-03-11 20:30:04,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:04,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413945012] [2021-03-11 20:30:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:30:04,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:30:04,644 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-11 20:30:04,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-11 20:30:04,656 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-11 20:30:04,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-11 20:30:04,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:30:04,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:30:04,680 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-11 20:30:04,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413945012] [2021-03-11 20:30:04,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:30:04,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:30:04,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368332165] [2021-03-11 20:30:04,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:30:04,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:30:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:30:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:30:04,682 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 179 [2021-03-11 20:30:04,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 42 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:04,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:30:04,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 179 [2021-03-11 20:30:04,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:30:04,774 INFO L129 PetriNetUnfolder]: 18/95 cut-off events. [2021-03-11 20:30:04,774 INFO L130 PetriNetUnfolder]: For 367/391 co-relation queries the response was YES. [2021-03-11 20:30:04,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 95 events. 18/95 cut-off events. For 367/391 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 385 event pairs, 0 based on Foata normal form. 9/101 useless extension candidates. Maximal degree in co-relation 356. Up to 27 conditions per place. [2021-03-11 20:30:04,775 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 4 changer transitions 11/45 dead transitions. [2021-03-11 20:30:04,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 45 transitions, 376 flow [2021-03-11 20:30:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:30:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:30:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2021-03-11 20:30:04,777 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7197392923649907 [2021-03-11 20:30:04,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2021-03-11 20:30:04,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2021-03-11 20:30:04,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:30:04,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2021-03-11 20:30:04,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 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-11 20:30:04,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:30:04,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 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-11 20:30:04,780 INFO L185 Difference]: Start difference. First operand has 78 places, 42 transitions, 305 flow. Second operand 6 states and 773 transitions. [2021-03-11 20:30:04,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 45 transitions, 376 flow [2021-03-11 20:30:04,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 45 transitions, 351 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-11 20:30:04,783 INFO L241 Difference]: Finished difference. Result has 69 places, 34 transitions, 222 flow [2021-03-11 20:30:04,783 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2021-03-11 20:30:04,783 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2021-03-11 20:30:04,783 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 34 transitions, 222 flow [2021-03-11 20:30:04,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:30:04,784 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:30:04,784 INFO L255 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-11 20:30:04,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-11 20:30:04,784 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:30:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:30:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash 251953756, now seen corresponding path program 7 times [2021-03-11 20:30:04,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:30:04,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113945280] [2021-03-11 20:30:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:30:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:30:04,837 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:30:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:30:04,913 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:30:04,954 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:30:04,954 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:30:04,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-11 20:30:05,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:30:05 BasicIcfg [2021-03-11 20:30:05,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:30:05,053 INFO L168 Benchmark]: Toolchain (without parser) took 29992.89 ms. Allocated memory was 255.9 MB in the beginning and 876.6 MB in the end (delta: 620.8 MB). Free memory was 233.7 MB in the beginning and 687.9 MB in the end (delta: -454.2 MB). Peak memory consumption was 167.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:30:05,053 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:30:05,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.75 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 233.1 MB in the beginning and 335.4 MB in the end (delta: -102.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:30:05,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.76 ms. Allocated memory is still 379.6 MB. Free memory was 335.4 MB in the beginning and 332.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:30:05,053 INFO L168 Benchmark]: Boogie Preprocessor took 31.09 ms. Allocated memory is still 379.6 MB. Free memory was 332.6 MB in the beginning and 329.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:30:05,053 INFO L168 Benchmark]: RCFGBuilder took 2457.03 ms. Allocated memory is still 379.6 MB. Free memory was 329.8 MB in the beginning and 271.4 MB in the end (delta: 58.4 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:30:05,054 INFO L168 Benchmark]: TraceAbstraction took 26893.13 ms. Allocated memory was 379.6 MB in the beginning and 876.6 MB in the end (delta: 497.0 MB). Free memory was 270.4 MB in the beginning and 687.9 MB in the end (delta: -417.6 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:30:05,054 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 548.75 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 233.1 MB in the beginning and 335.4 MB in the end (delta: -102.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.76 ms. Allocated memory is still 379.6 MB. Free memory was 335.4 MB in the beginning and 332.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.09 ms. Allocated memory is still 379.6 MB. Free memory was 332.6 MB in the beginning and 329.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2457.03 ms. Allocated memory is still 379.6 MB. Free memory was 329.8 MB in the beginning and 271.4 MB in the end (delta: 58.4 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26893.13 ms. Allocated memory was 379.6 MB in the beginning and 876.6 MB in the end (delta: 497.0 MB). Free memory was 270.4 MB in the beginning and 687.9 MB in the end (delta: -417.6 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16692.1ms, 102 PlacesBefore, 33 PlacesAfterwards, 94 TransitionsBefore, 23 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 4922 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1764, positive: 1575, positive conditional: 0, positive unconditional: 1575, negative: 189, negative conditional: 0, negative unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1116, positive: 1049, positive conditional: 0, positive unconditional: 1049, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1116, positive: 1040, positive conditional: 0, positive unconditional: 1040, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1751, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 1668, negative conditional: 0, negative unconditional: 1668, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1764, positive: 526, positive conditional: 0, positive unconditional: 526, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 1116, unknown conditional: 0, unknown unconditional: 1116] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2543; [L850] FCALL, FORK 0 pthread_create(&t2543, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2544; [L852] FCALL, FORK 0 pthread_create(&t2544, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2545; [L854] FCALL, FORK 0 pthread_create(&t2545, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26643.2ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 5665.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16780.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 93 SDslu, 45 SDs, 0 SdLazy, 1077 SolverSat, 429 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1698.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2372.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1574occurred in iteration=14, InterpolantAutomatonStates: 153, 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: 100.9ms SsaConstructionTime, 839.8ms SatisfiabilityAnalysisTime, 2831.0ms InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 3810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...