/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/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 19:59:06,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 19:59:06,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 19:59:06,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 19:59:06,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 19:59:06,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 19:59:06,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 19:59:06,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 19:59:06,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 19:59:06,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 19:59:06,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 19:59:06,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 19:59:06,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 19:59:06,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 19:59:06,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 19:59:06,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 19:59:06,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 19:59:06,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 19:59:06,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 19:59:06,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 19:59:06,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 19:59:06,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 19:59:06,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 19:59:06,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 19:59:06,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 19:59:06,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 19:59:06,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 19:59:06,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 19:59:06,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 19:59:06,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 19:59:06,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 19:59:06,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 19:59:06,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 19:59:06,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 19:59:06,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 19:59:06,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 19:59:06,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 19:59:06,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 19:59:06,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 19:59:06,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 19:59:06,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 19:59:06,633 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 19:59:06,659 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 19:59:06,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 19:59:06,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 19:59:06,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 19:59:06,661 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 19:59:06,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 19:59:06,661 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 19:59:06,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 19:59:06,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 19:59:06,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 19:59:06,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 19:59:06,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 19:59:06,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 19:59:06,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 19:59:06,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 19:59:06,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 19:59:06,664 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 19:59:06,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 19:59:06,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 19:59:06,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 19:59:06,913 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 19:59:06,914 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 19:59:06,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2021-03-11 19:59:06,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e21d2d8/a53d5b28e5614e30b93de75f9ba6e035/FLAGfb8b7e8db [2021-03-11 19:59:07,333 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 19:59:07,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2021-03-11 19:59:07,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e21d2d8/a53d5b28e5614e30b93de75f9ba6e035/FLAGfb8b7e8db [2021-03-11 19:59:07,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e21d2d8/a53d5b28e5614e30b93de75f9ba6e035 [2021-03-11 19:59:07,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 19:59:07,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 19:59:07,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 19:59:07,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 19:59:07,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 19:59:07,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:59:07" (1/1) ... [2021-03-11 19:59:07,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bca6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:07, skipping insertion in model container [2021-03-11 19:59:07,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 07:59:07" (1/1) ... [2021-03-11 19:59:07,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 19:59:07,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 19:59:07,821 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/mix005_tso.oepc.i[949,962] [2021-03-11 19:59:08,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:59:08,039 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 19:59:08,047 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/mix005_tso.oepc.i[949,962] [2021-03-11 19:59:08,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 19:59:08,155 INFO L208 MainTranslator]: Completed translation [2021-03-11 19:59:08,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08 WrapperNode [2021-03-11 19:59:08,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 19:59:08,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 19:59:08,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 19:59:08,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 19:59:08,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 19:59:08,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 19:59:08,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 19:59:08,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 19:59:08,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (1/1) ... [2021-03-11 19:59:08,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 19:59:08,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 19:59:08,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 19:59:08,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 19:59:08,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (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 19:59:08,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 19:59:08,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 19:59:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 19:59:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 19:59:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 19:59:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 19:59:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 19:59:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 19:59:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 19:59:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 19:59:08,297 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 19:59:08,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 19:59:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 19:59:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 19:59:08,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 19:59:08,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 19:59:08,299 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 19:59:09,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 19:59:09,595 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 19:59:09,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:59:09 BoogieIcfgContainer [2021-03-11 19:59:09,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 19:59:09,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 19:59:09,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 19:59:09,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 19:59:09,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 07:59:07" (1/3) ... [2021-03-11 19:59:09,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de9ba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:59:09, skipping insertion in model container [2021-03-11 19:59:09,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 07:59:08" (2/3) ... [2021-03-11 19:59:09,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de9ba0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 07:59:09, skipping insertion in model container [2021-03-11 19:59:09,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 07:59:09" (3/3) ... [2021-03-11 19:59:09,602 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2021-03-11 19:59:09,606 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 19:59:09,609 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 19:59:09,609 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 19:59:09,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,644 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,644 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,644 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,644 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,647 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,648 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,663 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,667 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,668 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,670 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,670 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 19:59:09,672 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 19:59:09,682 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 19:59:09,704 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 19:59:09,704 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 19:59:09,705 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 19:59:09,705 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 19:59:09,705 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 19:59:09,705 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 19:59:09,705 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 19:59:09,705 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 19:59:09,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-11 19:59:09,755 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-11 19:59:09,755 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:09,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 19:59:09,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-11 19:59:09,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:09,772 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 19:59:09,777 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:09,779 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:09,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-11 19:59:09,796 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-11 19:59:09,796 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:09,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 19:59:09,798 INFO L116 LiptonReduction]: Number of co-enabled transitions 2878 [2021-03-11 19:59:10,595 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2021-03-11 19:59:10,853 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-11 19:59:12,097 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-03-11 19:59:12,645 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-11 19:59:13,630 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 19:59:13,987 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-11 19:59:14,099 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 19:59:14,378 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 19:59:14,494 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 19:59:16,347 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 200 [2021-03-11 19:59:16,662 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-03-11 19:59:17,848 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 286 DAG size of output: 284 [2021-03-11 19:59:18,456 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2021-03-11 19:59:18,733 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2021-03-11 19:59:19,013 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2021-03-11 19:59:19,580 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-11 19:59:20,142 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-11 19:59:21,295 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 210 [2021-03-11 19:59:21,777 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2021-03-11 19:59:22,369 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 293 [2021-03-11 19:59:23,435 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 291 [2021-03-11 19:59:24,531 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 19:59:24,678 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 19:59:25,014 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-11 19:59:25,162 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-11 19:59:25,166 INFO L131 LiptonReduction]: Checked pairs total: 8656 [2021-03-11 19:59:25,166 INFO L133 LiptonReduction]: Total number of compositions: 94 [2021-03-11 19:59:25,167 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15397 [2021-03-11 19:59:25,173 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2021-03-11 19:59:25,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:25,173 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:25,174 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 19:59:25,174 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1170889004, now seen corresponding path program 1 times [2021-03-11 19:59:25,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:25,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128269384] [2021-03-11 19:59:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:25,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:25,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:25,307 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 19:59:25,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128269384] [2021-03-11 19:59:25,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:25,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:59:25,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912959513] [2021-03-11 19:59:25,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:59:25,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:59:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:59:25,325 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-11 19:59:25,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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 19:59:25,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:25,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-11 19:59:25,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:25,452 INFO L129 PetriNetUnfolder]: 185/323 cut-off events. [2021-03-11 19:59:25,452 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:25,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 323 events. 185/323 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1585 event pairs, 123 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 607. Up to 209 conditions per place. [2021-03-11 19:59:25,457 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 11 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2021-03-11 19:59:25,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 114 flow [2021-03-11 19:59:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:59:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:59:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2021-03-11 19:59:25,470 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8613707165109035 [2021-03-11 19:59:25,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2021-03-11 19:59:25,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2021-03-11 19:59:25,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:25,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2021-03-11 19:59:25,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 19:59:25,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 19:59:25,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 19:59:25,486 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 553 transitions. [2021-03-11 19:59:25,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 114 flow [2021-03-11 19:59:25,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 19:59:25,489 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2021-03-11 19:59:25,490 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-11 19:59:25,491 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2021-03-11 19:59:25,491 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2021-03-11 19:59:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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 19:59:25,491 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:25,491 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:25,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 19:59:25,491 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1767005073, now seen corresponding path program 1 times [2021-03-11 19:59:25,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:25,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636953593] [2021-03-11 19:59:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:25,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:25,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:25,579 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 19:59:25,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636953593] [2021-03-11 19:59:25,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:25,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:59:25,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171401097] [2021-03-11 19:59:25,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:59:25,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:59:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:59:25,581 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 214 [2021-03-11 19:59:25,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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 19:59:25,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:25,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 214 [2021-03-11 19:59:25,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:25,589 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-11 19:59:25,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 19:59:25,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 19:59:25,590 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-11 19:59:25,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-11 19:59:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:59:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:59:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-03-11 19:59:25,591 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8987538940809969 [2021-03-11 19:59:25,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-03-11 19:59:25,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-03-11 19:59:25,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:25,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-03-11 19:59:25,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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 19:59:25,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 19:59:25,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 19:59:25,594 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 577 transitions. [2021-03-11 19:59:25,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-11 19:59:25,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:25,595 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2021-03-11 19:59:25,595 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-11 19:59:25,596 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2021-03-11 19:59:25,596 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 74 flow [2021-03-11 19:59:25,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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 19:59:25,596 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:25,596 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:25,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 19:59:25,596 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1536372879, now seen corresponding path program 1 times [2021-03-11 19:59:25,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:25,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247436073] [2021-03-11 19:59:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:25,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:25,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:25,648 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 19:59:25,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247436073] [2021-03-11 19:59:25,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:25,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 19:59:25,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593219734] [2021-03-11 19:59:25,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 19:59:25,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:25,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 19:59:25,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 19:59:25,649 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 214 [2021-03-11 19:59:25,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:25,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:25,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 214 [2021-03-11 19:59:25,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:25,658 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-11 19:59:25,658 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-11 19:59:25,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 0/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 19:59:25,658 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-11 19:59:25,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 80 flow [2021-03-11 19:59:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 19:59:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 19:59:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2021-03-11 19:59:25,660 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8940809968847352 [2021-03-11 19:59:25,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 574 transitions. [2021-03-11 19:59:25,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 574 transitions. [2021-03-11 19:59:25,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:25,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 574 transitions. [2021-03-11 19:59:25,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:25,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 19:59:25,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states 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 19:59:25,663 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 74 flow. Second operand 3 states and 574 transitions. [2021-03-11 19:59:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 80 flow [2021-03-11 19:59:25,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:25,664 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 78 flow [2021-03-11 19:59:25,664 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-11 19:59:25,664 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2021-03-11 19:59:25,664 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 78 flow [2021-03-11 19:59:25,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:25,664 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:25,664 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:25,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 19:59:25,665 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1014422485, now seen corresponding path program 1 times [2021-03-11 19:59:25,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:25,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145689132] [2021-03-11 19:59:25,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:25,733 INFO L142 QuantifierPusher]: treesize reduction 20, result has 58.3 percent of original size [2021-03-11 19:59:25,734 INFO L147 QuantifierPusher]: treesize reduction 10, result has 64.3 percent of original size 18 [2021-03-11 19:59:25,756 INFO L142 QuantifierPusher]: treesize reduction 34, result has 33.3 percent of original size [2021-03-11 19:59:25,757 INFO L147 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size 13 [2021-03-11 19:59:25,769 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 19:59:25,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145689132] [2021-03-11 19:59:25,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:25,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 19:59:25,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752990280] [2021-03-11 19:59:25,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:25,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:25,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:25,771 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2021-03-11 19:59:25,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 19:59:25,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:25,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2021-03-11 19:59:25,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:25,856 INFO L129 PetriNetUnfolder]: 185/334 cut-off events. [2021-03-11 19:59:25,856 INFO L130 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2021-03-11 19:59:25,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 334 events. 185/334 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1514 event pairs, 92 based on Foata normal form. 12/326 useless extension candidates. Maximal degree in co-relation 669. Up to 229 conditions per place. [2021-03-11 19:59:25,860 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 14 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2021-03-11 19:59:25,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 132 flow [2021-03-11 19:59:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:59:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:59:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2021-03-11 19:59:25,863 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8177570093457944 [2021-03-11 19:59:25,863 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2021-03-11 19:59:25,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2021-03-11 19:59:25,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:25,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2021-03-11 19:59:25,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:25,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:25,866 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:25,866 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 78 flow. Second operand 4 states and 700 transitions. [2021-03-11 19:59:25,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 132 flow [2021-03-11 19:59:25,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:25,867 INFO L241 Difference]: Finished difference. Result has 45 places, 31 transitions, 97 flow [2021-03-11 19:59:25,868 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2021-03-11 19:59:25,868 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2021-03-11 19:59:25,868 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 97 flow [2021-03-11 19:59:25,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 19:59:25,868 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:25,868 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:25,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 19:59:25,868 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 621456880, now seen corresponding path program 1 times [2021-03-11 19:59:25,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:25,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116912437] [2021-03-11 19:59:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:25,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:25,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:59:25,937 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 19:59:25,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 19:59:25,951 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-03-11 19:59:25,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 19:59:25,958 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 19:59:25,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116912437] [2021-03-11 19:59:25,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:25,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:25,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947633449] [2021-03-11 19:59:25,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:25,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:25,959 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 214 [2021-03-11 19:59:25,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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 19:59:25,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:25,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 214 [2021-03-11 19:59:25,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:26,064 INFO L129 PetriNetUnfolder]: 216/417 cut-off events. [2021-03-11 19:59:26,064 INFO L130 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2021-03-11 19:59:26,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 417 events. 216/417 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2104 event pairs, 13 based on Foata normal form. 8/407 useless extension candidates. Maximal degree in co-relation 943. Up to 272 conditions per place. [2021-03-11 19:59:26,067 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 14 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2021-03-11 19:59:26,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 180 flow [2021-03-11 19:59:26,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:59:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:59:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2021-03-11 19:59:26,069 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7962616822429907 [2021-03-11 19:59:26,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2021-03-11 19:59:26,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2021-03-11 19:59:26,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:26,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2021-03-11 19:59:26,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 0 states 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 19:59:26,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 19:59:26,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 19:59:26,073 INFO L185 Difference]: Start difference. First operand has 45 places, 31 transitions, 97 flow. Second operand 5 states and 852 transitions. [2021-03-11 19:59:26,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 180 flow [2021-03-11 19:59:26,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:59:26,076 INFO L241 Difference]: Finished difference. Result has 50 places, 39 transitions, 163 flow [2021-03-11 19:59:26,076 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2021-03-11 19:59:26,077 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2021-03-11 19:59:26,077 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 163 flow [2021-03-11 19:59:26,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states 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 19:59:26,077 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:26,077 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:26,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 19:59:26,078 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash -272396581, now seen corresponding path program 1 times [2021-03-11 19:59:26,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:26,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677000245] [2021-03-11 19:59:26,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:26,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:26,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:26,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:26,163 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 19:59:26,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677000245] [2021-03-11 19:59:26,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:26,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:26,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509471119] [2021-03-11 19:59:26,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:26,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:26,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:26,165 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 214 [2021-03-11 19:59:26,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:26,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:26,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 214 [2021-03-11 19:59:26,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:26,210 INFO L129 PetriNetUnfolder]: 123/352 cut-off events. [2021-03-11 19:59:26,211 INFO L130 PetriNetUnfolder]: For 1464/1631 co-relation queries the response was YES. [2021-03-11 19:59:26,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 352 events. 123/352 cut-off events. For 1464/1631 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2041 event pairs, 40 based on Foata normal form. 28/351 useless extension candidates. Maximal degree in co-relation 973. Up to 144 conditions per place. [2021-03-11 19:59:26,213 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 5 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-11 19:59:26,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 182 flow [2021-03-11 19:59:26,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:59:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:59:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 728 transitions. [2021-03-11 19:59:26,215 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8504672897196262 [2021-03-11 19:59:26,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 728 transitions. [2021-03-11 19:59:26,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 728 transitions. [2021-03-11 19:59:26,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:26,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 728 transitions. [2021-03-11 19:59:26,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 19:59:26,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:26,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:26,218 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 163 flow. Second operand 4 states and 728 transitions. [2021-03-11 19:59:26,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 182 flow [2021-03-11 19:59:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 177 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 19:59:26,221 INFO L241 Difference]: Finished difference. Result has 54 places, 40 transitions, 171 flow [2021-03-11 19:59:26,221 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2021-03-11 19:59:26,221 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2021-03-11 19:59:26,221 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 171 flow [2021-03-11 19:59:26,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:26,221 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:26,221 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] [2021-03-11 19:59:26,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 19:59:26,221 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1941687604, now seen corresponding path program 1 times [2021-03-11 19:59:26,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:26,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420760281] [2021-03-11 19:59:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:26,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:26,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:59:26,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:59:26,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:59:26,273 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 19:59:26,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420760281] [2021-03-11 19:59:26,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:26,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:26,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526384281] [2021-03-11 19:59:26,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:26,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:26,274 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2021-03-11 19:59:26,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 19:59:26,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:26,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2021-03-11 19:59:26,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:26,378 INFO L129 PetriNetUnfolder]: 389/747 cut-off events. [2021-03-11 19:59:26,378 INFO L130 PetriNetUnfolder]: For 1547/1835 co-relation queries the response was YES. [2021-03-11 19:59:26,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 747 events. 389/747 cut-off events. For 1547/1835 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4393 event pairs, 150 based on Foata normal form. 42/739 useless extension candidates. Maximal degree in co-relation 2438. Up to 512 conditions per place. [2021-03-11 19:59:26,383 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 13 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2021-03-11 19:59:26,383 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 247 flow [2021-03-11 19:59:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:59:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:59:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 712 transitions. [2021-03-11 19:59:26,385 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8317757009345794 [2021-03-11 19:59:26,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 712 transitions. [2021-03-11 19:59:26,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 712 transitions. [2021-03-11 19:59:26,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:26,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 712 transitions. [2021-03-11 19:59:26,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:26,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:26,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:26,388 INFO L185 Difference]: Start difference. First operand has 54 places, 40 transitions, 171 flow. Second operand 4 states and 712 transitions. [2021-03-11 19:59:26,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 247 flow [2021-03-11 19:59:26,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:59:26,391 INFO L241 Difference]: Finished difference. Result has 57 places, 44 transitions, 235 flow [2021-03-11 19:59:26,391 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2021-03-11 19:59:26,391 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2021-03-11 19:59:26,391 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 235 flow [2021-03-11 19:59:26,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 19:59:26,392 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:26,392 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:26,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 19:59:26,392 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2119894183, now seen corresponding path program 2 times [2021-03-11 19:59:26,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:26,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329994335] [2021-03-11 19:59:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:26,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:26,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:59:26,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:26,431 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 19:59:26,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329994335] [2021-03-11 19:59:26,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:26,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:26,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541554089] [2021-03-11 19:59:26,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:26,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:26,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:26,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:26,433 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-11 19:59:26,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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 19:59:26,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:26,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-11 19:59:26,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:26,586 INFO L129 PetriNetUnfolder]: 784/1520 cut-off events. [2021-03-11 19:59:26,586 INFO L130 PetriNetUnfolder]: For 2735/2915 co-relation queries the response was YES. [2021-03-11 19:59:26,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 1520 events. 784/1520 cut-off events. For 2735/2915 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 11068 event pairs, 333 based on Foata normal form. 125/1445 useless extension candidates. Maximal degree in co-relation 4279. Up to 822 conditions per place. [2021-03-11 19:59:26,599 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 10 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2021-03-11 19:59:26,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 301 flow [2021-03-11 19:59:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 19:59:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 19:59:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-03-11 19:59:26,601 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8570093457943925 [2021-03-11 19:59:26,601 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-03-11 19:59:26,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-03-11 19:59:26,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:26,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-03-11 19:59:26,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 states 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 19:59:26,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 19:59:26,605 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 19:59:26,605 INFO L185 Difference]: Start difference. First operand has 57 places, 44 transitions, 235 flow. Second operand 5 states and 917 transitions. [2021-03-11 19:59:26,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 301 flow [2021-03-11 19:59:26,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 276 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:26,611 INFO L241 Difference]: Finished difference. Result has 62 places, 53 transitions, 285 flow [2021-03-11 19:59:26,611 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2021-03-11 19:59:26,611 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2021-03-11 19:59:26,611 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 285 flow [2021-03-11 19:59:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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 19:59:26,613 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:26,613 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, 1] [2021-03-11 19:59:26,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 19:59:26,613 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 406934278, now seen corresponding path program 1 times [2021-03-11 19:59:26,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:26,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116330159] [2021-03-11 19:59:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:26,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:26,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 19:59:26,704 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-03-11 19:59:26,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 19:59:26,713 INFO L142 QuantifierPusher]: treesize reduction 14, result has 54.8 percent of original size [2021-03-11 19:59:26,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 19:59:26,724 INFO L142 QuantifierPusher]: treesize reduction 10, result has 67.7 percent of original size [2021-03-11 19:59:26,725 INFO L147 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size 18 [2021-03-11 19:59:26,744 INFO L142 QuantifierPusher]: treesize reduction 10, result has 67.7 percent of original size [2021-03-11 19:59:26,745 INFO L147 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size 18 [2021-03-11 19:59:26,745 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 19:59:26,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116330159] [2021-03-11 19:59:26,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:26,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:59:26,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582545063] [2021-03-11 19:59:26,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:59:26,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:59:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:59:26,747 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 214 [2021-03-11 19:59:26,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states 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 19:59:26,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:26,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 214 [2021-03-11 19:59:26,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:27,189 INFO L129 PetriNetUnfolder]: 1591/2841 cut-off events. [2021-03-11 19:59:27,189 INFO L130 PetriNetUnfolder]: For 6050/7802 co-relation queries the response was YES. [2021-03-11 19:59:27,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10072 conditions, 2841 events. 1591/2841 cut-off events. For 6050/7802 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 20831 event pairs, 550 based on Foata normal form. 134/2634 useless extension candidates. Maximal degree in co-relation 10049. Up to 1579 conditions per place. [2021-03-11 19:59:27,211 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 17 selfloop transitions, 26 changer transitions 0/73 dead transitions. [2021-03-11 19:59:27,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 492 flow [2021-03-11 19:59:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 19:59:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 19:59:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1346 transitions. [2021-03-11 19:59:27,214 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7862149532710281 [2021-03-11 19:59:27,214 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1346 transitions. [2021-03-11 19:59:27,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1346 transitions. [2021-03-11 19:59:27,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:27,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1346 transitions. [2021-03-11 19:59:27,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 168.25) internal successors, (1346), 8 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states 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 19:59:27,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 19:59:27,219 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 19:59:27,219 INFO L185 Difference]: Start difference. First operand has 62 places, 53 transitions, 285 flow. Second operand 8 states and 1346 transitions. [2021-03-11 19:59:27,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 492 flow [2021-03-11 19:59:27,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 19:59:27,238 INFO L241 Difference]: Finished difference. Result has 70 places, 65 transitions, 431 flow [2021-03-11 19:59:27,238 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=431, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2021-03-11 19:59:27,239 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2021-03-11 19:59:27,239 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 431 flow [2021-03-11 19:59:27,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.16666666666666) internal successors, (991), 6 states have internal predecessors, (991), 0 states have call successors, (0), 0 states 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 19:59:27,239 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:27,239 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 19:59:27,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 19:59:27,239 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1688700691, now seen corresponding path program 1 times [2021-03-11 19:59:27,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:27,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734252252] [2021-03-11 19:59:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:27,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:59:27,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:27,301 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 19:59:27,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734252252] [2021-03-11 19:59:27,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:27,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 19:59:27,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456314372] [2021-03-11 19:59:27,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 19:59:27,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 19:59:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 19:59:27,303 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-11 19:59:27,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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 19:59:27,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:27,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-11 19:59:27,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:27,497 INFO L129 PetriNetUnfolder]: 836/1817 cut-off events. [2021-03-11 19:59:27,497 INFO L130 PetriNetUnfolder]: For 4246/9993 co-relation queries the response was YES. [2021-03-11 19:59:27,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 1817 events. 836/1817 cut-off events. For 4246/9993 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 14633 event pairs, 118 based on Foata normal form. 679/2294 useless extension candidates. Maximal degree in co-relation 7231. Up to 1266 conditions per place. [2021-03-11 19:59:27,510 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 10 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2021-03-11 19:59:27,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 565 flow [2021-03-11 19:59:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 19:59:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 19:59:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1284 transitions. [2021-03-11 19:59:27,513 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-11 19:59:27,513 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1284 transitions. [2021-03-11 19:59:27,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1284 transitions. [2021-03-11 19:59:27,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:27,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1284 transitions. [2021-03-11 19:59:27,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.42857142857142) internal successors, (1284), 7 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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 19:59:27,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states 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 19:59:27,518 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states 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 19:59:27,518 INFO L185 Difference]: Start difference. First operand has 70 places, 65 transitions, 431 flow. Second operand 7 states and 1284 transitions. [2021-03-11 19:59:27,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 565 flow [2021-03-11 19:59:27,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 529 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-11 19:59:27,525 INFO L241 Difference]: Finished difference. Result has 77 places, 74 transitions, 529 flow [2021-03-11 19:59:27,525 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=529, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2021-03-11 19:59:27,525 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2021-03-11 19:59:27,526 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 529 flow [2021-03-11 19:59:27,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states 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 19:59:27,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:27,526 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, 1] [2021-03-11 19:59:27,526 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 19:59:27,526 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1358146485, now seen corresponding path program 1 times [2021-03-11 19:59:27,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:27,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818550269] [2021-03-11 19:59:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:27,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:59:27,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:27,594 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 19:59:27,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818550269] [2021-03-11 19:59:27,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:27,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 19:59:27,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439322635] [2021-03-11 19:59:27,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 19:59:27,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 19:59:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 19:59:27,598 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-11 19:59:27,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states 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 19:59:27,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:27,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-11 19:59:27,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:27,803 INFO L129 PetriNetUnfolder]: 674/1534 cut-off events. [2021-03-11 19:59:27,803 INFO L130 PetriNetUnfolder]: For 9325/26352 co-relation queries the response was YES. [2021-03-11 19:59:27,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1534 events. 674/1534 cut-off events. For 9325/26352 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 12492 event pairs, 25 based on Foata normal form. 1029/2387 useless extension candidates. Maximal degree in co-relation 8118. Up to 1159 conditions per place. [2021-03-11 19:59:27,817 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 6 selfloop transitions, 28 changer transitions 4/87 dead transitions. [2021-03-11 19:59:27,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 731 flow [2021-03-11 19:59:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 19:59:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 19:59:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1651 transitions. [2021-03-11 19:59:27,820 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8572170301142263 [2021-03-11 19:59:27,820 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1651 transitions. [2021-03-11 19:59:27,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1651 transitions. [2021-03-11 19:59:27,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:27,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1651 transitions. [2021-03-11 19:59:27,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 183.44444444444446) internal successors, (1651), 9 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states 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 19:59:27,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states 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 19:59:27,826 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states 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 19:59:27,826 INFO L185 Difference]: Start difference. First operand has 77 places, 74 transitions, 529 flow. Second operand 9 states and 1651 transitions. [2021-03-11 19:59:27,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 731 flow [2021-03-11 19:59:27,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 87 transitions, 681 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-11 19:59:27,850 INFO L241 Difference]: Finished difference. Result has 85 places, 83 transitions, 657 flow [2021-03-11 19:59:27,851 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=657, PETRI_PLACES=85, PETRI_TRANSITIONS=83} [2021-03-11 19:59:27,851 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2021-03-11 19:59:27,851 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 83 transitions, 657 flow [2021-03-11 19:59:27,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states 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 19:59:27,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:27,851 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, 1, 1, 1, 1] [2021-03-11 19:59:27,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 19:59:27,852 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:27,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:27,852 INFO L82 PathProgramCache]: Analyzing trace with hash -579154302, now seen corresponding path program 1 times [2021-03-11 19:59:27,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:27,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497366552] [2021-03-11 19:59:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:27,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:27,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:27,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:27,892 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 19:59:27,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497366552] [2021-03-11 19:59:27,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:27,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:27,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351139715] [2021-03-11 19:59:27,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:27,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:27,894 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 214 [2021-03-11 19:59:27,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 83 transitions, 657 flow. Second operand has 4 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:27,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:27,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 214 [2021-03-11 19:59:27,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:28,146 INFO L129 PetriNetUnfolder]: 1377/3189 cut-off events. [2021-03-11 19:59:28,146 INFO L130 PetriNetUnfolder]: For 18139/20970 co-relation queries the response was YES. [2021-03-11 19:59:28,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15394 conditions, 3189 events. 1377/3189 cut-off events. For 18139/20970 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 30342 event pairs, 49 based on Foata normal form. 18/2890 useless extension candidates. Maximal degree in co-relation 15361. Up to 1613 conditions per place. [2021-03-11 19:59:28,178 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 5 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2021-03-11 19:59:28,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 676 flow [2021-03-11 19:59:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:59:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:59:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 728 transitions. [2021-03-11 19:59:28,180 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8504672897196262 [2021-03-11 19:59:28,180 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 728 transitions. [2021-03-11 19:59:28,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 728 transitions. [2021-03-11 19:59:28,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:28,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 728 transitions. [2021-03-11 19:59:28,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 19:59:28,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:28,183 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:28,183 INFO L185 Difference]: Start difference. First operand has 85 places, 83 transitions, 657 flow. Second operand 4 states and 728 transitions. [2021-03-11 19:59:28,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 676 flow [2021-03-11 19:59:28,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 85 transitions, 579 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-11 19:59:28,474 INFO L241 Difference]: Finished difference. Result has 86 places, 84 transitions, 573 flow [2021-03-11 19:59:28,474 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=573, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2021-03-11 19:59:28,474 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2021-03-11 19:59:28,474 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 573 flow [2021-03-11 19:59:28,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 19:59:28,475 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:28,475 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, 1, 1, 1, 1] [2021-03-11 19:59:28,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 19:59:28,475 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -672296784, now seen corresponding path program 2 times [2021-03-11 19:59:28,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:28,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547444297] [2021-03-11 19:59:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:28,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:28,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:28,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:28,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:28,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:28,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:28,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:28,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:28,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:28,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 19:59:28,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:28,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:28,573 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 19:59:28,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547444297] [2021-03-11 19:59:28,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:28,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 19:59:28,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485157165] [2021-03-11 19:59:28,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 19:59:28,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 19:59:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 19:59:28,575 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 214 [2021-03-11 19:59:28,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 573 flow. Second operand has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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 19:59:28,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:28,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 214 [2021-03-11 19:59:28,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:28,886 INFO L129 PetriNetUnfolder]: 1215/2766 cut-off events. [2021-03-11 19:59:28,886 INFO L130 PetriNetUnfolder]: For 11432/20212 co-relation queries the response was YES. [2021-03-11 19:59:28,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11990 conditions, 2766 events. 1215/2766 cut-off events. For 11432/20212 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 25557 event pairs, 28 based on Foata normal form. 1698/4150 useless extension candidates. Maximal degree in co-relation 11955. Up to 750 conditions per place. [2021-03-11 19:59:28,903 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 2 selfloop transitions, 33 changer transitions 11/89 dead transitions. [2021-03-11 19:59:28,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 707 flow [2021-03-11 19:59:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 19:59:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 19:59:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2010 transitions. [2021-03-11 19:59:28,907 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8538657604078165 [2021-03-11 19:59:28,907 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2010 transitions. [2021-03-11 19:59:28,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2010 transitions. [2021-03-11 19:59:28,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:28,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2010 transitions. [2021-03-11 19:59:28,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 182.72727272727272) internal successors, (2010), 11 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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 19:59:28,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 19:59:28,923 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 214.0) internal successors, (2568), 12 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states 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 19:59:28,923 INFO L185 Difference]: Start difference. First operand has 86 places, 84 transitions, 573 flow. Second operand 11 states and 2010 transitions. [2021-03-11 19:59:28,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 707 flow [2021-03-11 19:59:29,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 89 transitions, 685 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-11 19:59:29,047 INFO L241 Difference]: Finished difference. Result has 95 places, 78 transitions, 596 flow [2021-03-11 19:59:29,047 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=596, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2021-03-11 19:59:29,047 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2021-03-11 19:59:29,047 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 596 flow [2021-03-11 19:59:29,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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 19:59:29,048 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:29,048 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:29,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 19:59:29,048 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1662785383, now seen corresponding path program 1 times [2021-03-11 19:59:29,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:29,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626295128] [2021-03-11 19:59:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 19:59:29,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:29,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 19:59:29,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:29,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:29,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 19:59:29,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 19:59:29,113 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 19:59:29,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626295128] [2021-03-11 19:59:29,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 19:59:29,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 19:59:29,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555604027] [2021-03-11 19:59:29,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 19:59:29,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 19:59:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 19:59:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 19:59:29,115 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 214 [2021-03-11 19:59:29,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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 19:59:29,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 19:59:29,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 214 [2021-03-11 19:59:29,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 19:59:29,480 INFO L129 PetriNetUnfolder]: 2056/4645 cut-off events. [2021-03-11 19:59:29,480 INFO L130 PetriNetUnfolder]: For 14773/16953 co-relation queries the response was YES. [2021-03-11 19:59:29,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20275 conditions, 4645 events. 2056/4645 cut-off events. For 14773/16953 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 47063 event pairs, 52 based on Foata normal form. 12/4181 useless extension candidates. Maximal degree in co-relation 20239. Up to 1300 conditions per place. [2021-03-11 19:59:29,505 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 3 selfloop transitions, 2 changer transitions 6/79 dead transitions. [2021-03-11 19:59:29,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 79 transitions, 608 flow [2021-03-11 19:59:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 19:59:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 19:59:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 762 transitions. [2021-03-11 19:59:29,508 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8901869158878505 [2021-03-11 19:59:29,508 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 762 transitions. [2021-03-11 19:59:29,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 762 transitions. [2021-03-11 19:59:29,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 19:59:29,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 762 transitions. [2021-03-11 19:59:29,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.5) internal successors, (762), 4 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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 19:59:29,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:29,511 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 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 19:59:29,511 INFO L185 Difference]: Start difference. First operand has 95 places, 78 transitions, 596 flow. Second operand 4 states and 762 transitions. [2021-03-11 19:59:29,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 79 transitions, 608 flow [2021-03-11 19:59:29,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 492 flow, removed 26 selfloop flow, removed 11 redundant places. [2021-03-11 19:59:29,951 INFO L241 Difference]: Finished difference. Result has 87 places, 73 transitions, 451 flow [2021-03-11 19:59:29,951 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2021-03-11 19:59:29,951 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2021-03-11 19:59:29,951 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 451 flow [2021-03-11 19:59:29,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states 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 19:59:29,952 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 19:59:29,952 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 19:59:29,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 19:59:29,952 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 19:59:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 19:59:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2006648723, now seen corresponding path program 2 times [2021-03-11 19:59:29,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 19:59:29,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677381021] [2021-03-11 19:59:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 19:59:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:59:29,984 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:59:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 19:59:30,019 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 19:59:30,048 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 19:59:30,048 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 19:59:30,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 19:59:30,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 07:59:30 BasicIcfg [2021-03-11 19:59:30,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 19:59:30,124 INFO L168 Benchmark]: Toolchain (without parser) took 22437.76 ms. Allocated memory was 348.1 MB in the beginning and 725.6 MB in the end (delta: 377.5 MB). Free memory was 311.6 MB in the beginning and 381.0 MB in the end (delta: -69.3 MB). Peak memory consumption was 309.7 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:30,124 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 348.1 MB. Free memory was 329.7 MB in the beginning and 329.6 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 19:59:30,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.47 ms. Allocated memory is still 348.1 MB. Free memory was 311.0 MB in the beginning and 308.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:30,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.91 ms. Allocated memory is still 348.1 MB. Free memory was 308.1 MB in the beginning and 305.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:30,125 INFO L168 Benchmark]: Boogie Preprocessor took 28.11 ms. Allocated memory is still 348.1 MB. Free memory was 305.0 MB in the beginning and 302.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:30,125 INFO L168 Benchmark]: RCFGBuilder took 1348.14 ms. Allocated memory is still 348.1 MB. Free memory was 302.9 MB in the beginning and 212.9 MB in the end (delta: 90.0 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:30,125 INFO L168 Benchmark]: TraceAbstraction took 20525.06 ms. Allocated memory was 348.1 MB in the beginning and 725.6 MB in the end (delta: 377.5 MB). Free memory was 212.9 MB in the beginning and 381.0 MB in the end (delta: -168.1 MB). Peak memory consumption was 208.4 MB. Max. memory is 16.0 GB. [2021-03-11 19:59:30,126 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 348.1 MB. Free memory was 329.7 MB in the beginning and 329.6 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 465.47 ms. Allocated memory is still 348.1 MB. Free memory was 311.0 MB in the beginning and 308.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 63.91 ms. Allocated memory is still 348.1 MB. Free memory was 308.1 MB in the beginning and 305.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.11 ms. Allocated memory is still 348.1 MB. Free memory was 305.0 MB in the beginning and 302.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1348.14 ms. Allocated memory is still 348.1 MB. Free memory was 302.9 MB in the beginning and 212.9 MB in the end (delta: 90.0 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20525.06 ms. Allocated memory was 348.1 MB in the beginning and 725.6 MB in the end (delta: 377.5 MB). Free memory was 212.9 MB in the beginning and 381.0 MB in the end (delta: -168.1 MB). Peak memory consumption was 208.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15386.9ms, 127 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 8656 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4154, positive: 3902, positive conditional: 0, positive unconditional: 3902, negative: 252, negative conditional: 0, negative unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2082, positive: 1992, positive conditional: 0, positive unconditional: 1992, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2082, positive: 1975, positive conditional: 0, positive unconditional: 1975, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1256, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 1213, negative conditional: 0, negative unconditional: 1213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4154, positive: 1910, positive conditional: 0, positive unconditional: 1910, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 2082, unknown conditional: 0, unknown unconditional: 2082] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - CounterExampleResult [Line: 18]: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L790] 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) [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L813] 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) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] 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) [L813] 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) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 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 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 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 [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] 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) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] 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) [L871] 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) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 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 [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 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 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L882] 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) [L883] 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)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] 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)) [L883] 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)) [L884] 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)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] 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)) [L884] 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)) [L885] 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)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] 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)) [L885] 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)) [L886] 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)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] 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)) [L886] 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)) [L887] 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)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] 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)) [L887] 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)) [L888] 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)) [L888] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L888] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20348.2ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3630.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15466.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 321 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 337.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 300.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=11, InterpolantAutomatonStates: 74, 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: 38.7ms SsaConstructionTime, 373.4ms SatisfiabilityAnalysisTime, 601.8ms InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 1258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...