/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:11:26,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:11:26,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:11:26,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:11:26,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:11:26,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:11:26,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:11:26,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:11:26,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:11:26,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:11:26,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:11:26,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:11:26,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:11:26,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:11:26,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:11:26,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:11:26,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:11:26,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:11:26,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:11:26,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:11:26,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:11:26,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:11:26,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:11:26,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:11:26,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:11:26,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:11:26,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:11:26,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:11:26,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:11:26,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:11:26,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:11:26,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:11:26,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:11:26,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:11:26,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:11:26,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:11:26,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:11:26,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:11:26,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:11:26,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:11:26,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:11:26,550 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-NoLbe.epf [2021-06-10 12:11:26,572 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:11:26,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:11:26,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:11:26,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:11:26,575 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:11:26,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:11:26,575 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:11:26,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:11:26,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:11:26,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:11:26,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:11:26,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:11:26,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:11:26,577 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:11:26,578 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:11:26,578 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-06-10 12:11:26,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:11:26,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:11:26,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:11:26,841 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:11:26,841 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:11:26,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i [2021-06-10 12:11:26,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d0c2310/259069822fa740ecbb9261375d7bee15/FLAGa5fa5abe2 [2021-06-10 12:11:27,334 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:11:27,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i [2021-06-10 12:11:27,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d0c2310/259069822fa740ecbb9261375d7bee15/FLAGa5fa5abe2 [2021-06-10 12:11:27,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d0c2310/259069822fa740ecbb9261375d7bee15 [2021-06-10 12:11:27,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:11:27,357 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:11:27,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:11:27,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:11:27,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:11:27,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f8a8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27, skipping insertion in model container [2021-06-10 12:11:27,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:11:27,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:11:27,539 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/mix029_rmo.opt.i[948,961] [2021-06-10 12:11:27,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:11:27,663 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:11:27,670 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/mix029_rmo.opt.i[948,961] [2021-06-10 12:11:27,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:11:27,758 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:11:27,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27 WrapperNode [2021-06-10 12:11:27,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:11:27,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:11:27,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:11:27,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:11:27,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:11:27,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:11:27,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:11:27,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:11:27,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... [2021-06-10 12:11:27,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:11:27,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:11:27,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:11:27,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:11:27,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:11:27,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:11:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:11:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:11:27,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:11:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:11:27,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:11:27,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:11:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:11:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 12:11:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 12:11:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-10 12:11:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-10 12:11:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:11:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:11:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:11:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:11:27,933 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 12:11:29,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:11:29,439 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:11:29,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:11:29 BoogieIcfgContainer [2021-06-10 12:11:29,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:11:29,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:11:29,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:11:29,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:11:29,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:11:27" (1/3) ... [2021-06-10 12:11:29,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48875b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:11:29, skipping insertion in model container [2021-06-10 12:11:29,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:11:27" (2/3) ... [2021-06-10 12:11:29,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48875b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:11:29, skipping insertion in model container [2021-06-10 12:11:29,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:11:29" (3/3) ... [2021-06-10 12:11:29,446 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_rmo.opt.i [2021-06-10 12:11:29,450 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:11:29,454 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:11:29,454 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:11:29,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,482 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,491 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,495 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,498 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,499 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,513 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:11:29,516 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:11:29,528 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-10 12:11:29,550 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:11:29,550 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:11:29,550 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:11:29,550 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:11:29,550 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:11:29,550 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:11:29,550 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:11:29,550 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:11:29,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-06-10 12:11:29,612 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-06-10 12:11:29,612 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:11:29,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-10 12:11:29,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-06-10 12:11:29,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-06-10 12:11:29,645 INFO L129 PetriNetUnfolder]: 0/66 cut-off events. [2021-06-10 12:11:29,645 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:11:29,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:29,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-10 12:11:29,646 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:29,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1915824944, now seen corresponding path program 1 times [2021-06-10 12:11:29,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:29,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40584757] [2021-06-10 12:11:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:29,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:29,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:29,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:29,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:29,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40584757] [2021-06-10 12:11:29,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:29,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:11:29,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91748179] [2021-06-10 12:11:29,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:11:29,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:11:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:11:29,872 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 116 [2021-06-10 12:11:29,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 112 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:29,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:29,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 116 [2021-06-10 12:11:29,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:29,968 INFO L129 PetriNetUnfolder]: 49/419 cut-off events. [2021-06-10 12:11:29,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:11:29,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 419 events. 49/419 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2160 event pairs, 27 based on Foata normal form. 19/415 useless extension candidates. Maximal degree in co-relation 467. Up to 65 conditions per place. [2021-06-10 12:11:29,975 INFO L132 encePairwiseOnDemand]: 111/116 looper letters, 9 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2021-06-10 12:11:29,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 112 transitions, 258 flow [2021-06-10 12:11:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:11:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:11:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2021-06-10 12:11:29,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9511494252873564 [2021-06-10 12:11:29,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2021-06-10 12:11:29,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2021-06-10 12:11:29,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:29,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2021-06-10 12:11:29,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,002 INFO L185 Difference]: Start difference. First operand has 123 places, 112 transitions, 236 flow. Second operand 3 states and 331 transitions. [2021-06-10 12:11:30,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 112 transitions, 258 flow [2021-06-10 12:11:30,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 254 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-10 12:11:30,010 INFO L241 Difference]: Finished difference. Result has 119 places, 108 transitions, 228 flow [2021-06-10 12:11:30,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2021-06-10 12:11:30,012 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2021-06-10 12:11:30,012 INFO L480 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 228 flow [2021-06-10 12:11:30,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:30,013 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:30,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:11:30,013 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash -759396478, now seen corresponding path program 1 times [2021-06-10 12:11:30,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:30,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736032754] [2021-06-10 12:11:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:30,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:30,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:30,132 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:30,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:30,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:30,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:30,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:30,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736032754] [2021-06-10 12:11:30,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:30,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:11:30,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447430063] [2021-06-10 12:11:30,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:11:30,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:11:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:11:30,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 116 [2021-06-10 12:11:30,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:30,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 116 [2021-06-10 12:11:30,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:30,272 INFO L129 PetriNetUnfolder]: 4/149 cut-off events. [2021-06-10 12:11:30,273 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:11:30,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 149 events. 4/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 235 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 140. Up to 8 conditions per place. [2021-06-10 12:11:30,274 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 6 selfloop transitions, 2 changer transitions 25/120 dead transitions. [2021-06-10 12:11:30,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 294 flow [2021-06-10 12:11:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:11:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:11:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 959 transitions. [2021-06-10 12:11:30,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9185823754789272 [2021-06-10 12:11:30,277 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 959 transitions. [2021-06-10 12:11:30,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 959 transitions. [2021-06-10 12:11:30,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:30,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 959 transitions. [2021-06-10 12:11:30,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,284 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,284 INFO L185 Difference]: Start difference. First operand has 119 places, 108 transitions, 228 flow. Second operand 9 states and 959 transitions. [2021-06-10 12:11:30,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 294 flow [2021-06-10 12:11:30,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 120 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:11:30,287 INFO L241 Difference]: Finished difference. Result has 132 places, 95 transitions, 218 flow [2021-06-10 12:11:30,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=132, PETRI_TRANSITIONS=95} [2021-06-10 12:11:30,287 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 9 predicate places. [2021-06-10 12:11:30,288 INFO L480 AbstractCegarLoop]: Abstraction has has 132 places, 95 transitions, 218 flow [2021-06-10 12:11:30,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,288 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:30,288 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:30,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:11:30,288 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1702291734, now seen corresponding path program 1 times [2021-06-10 12:11:30,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:30,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102954083] [2021-06-10 12:11:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:30,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:30,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:30,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:30,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:11:30,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:11:30,466 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-06-10 12:11:30,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 12:11:30,483 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:30,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:30,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:30,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:30,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:30,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:30,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102954083] [2021-06-10 12:11:30,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:30,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-10 12:11:30,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298998562] [2021-06-10 12:11:30,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 12:11:30,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 12:11:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-10 12:11:30,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 116 [2021-06-10 12:11:30,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 95 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:30,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 116 [2021-06-10 12:11:30,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:30,852 INFO L129 PetriNetUnfolder]: 319/729 cut-off events. [2021-06-10 12:11:30,852 INFO L130 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2021-06-10 12:11:30,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 729 events. 319/729 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4025 event pairs, 81 based on Foata normal form. 19/733 useless extension candidates. Maximal degree in co-relation 1400. Up to 308 conditions per place. [2021-06-10 12:11:30,857 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 14 selfloop transitions, 11 changer transitions 43/147 dead transitions. [2021-06-10 12:11:30,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 147 transitions, 486 flow [2021-06-10 12:11:30,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-10 12:11:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-10 12:11:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1496 transitions. [2021-06-10 12:11:30,860 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8597701149425288 [2021-06-10 12:11:30,861 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1496 transitions. [2021-06-10 12:11:30,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1496 transitions. [2021-06-10 12:11:30,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:30,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1496 transitions. [2021-06-10 12:11:30,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.73333333333333) internal successors, (1496), 15 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,866 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,866 INFO L185 Difference]: Start difference. First operand has 132 places, 95 transitions, 218 flow. Second operand 15 states and 1496 transitions. [2021-06-10 12:11:30,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 147 transitions, 486 flow [2021-06-10 12:11:30,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 147 transitions, 446 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-06-10 12:11:30,871 INFO L241 Difference]: Finished difference. Result has 130 places, 102 transitions, 301 flow [2021-06-10 12:11:30,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=301, PETRI_PLACES=130, PETRI_TRANSITIONS=102} [2021-06-10 12:11:30,872 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 7 predicate places. [2021-06-10 12:11:30,872 INFO L480 AbstractCegarLoop]: Abstraction has has 130 places, 102 transitions, 301 flow [2021-06-10 12:11:30,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:30,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:30,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:30,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:11:30,873 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1970107188, now seen corresponding path program 1 times [2021-06-10 12:11:30,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:30,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812147752] [2021-06-10 12:11:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:31,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:31,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:31,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:31,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:11:31,025 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-10 12:11:31,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-10 12:11:31,044 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-06-10 12:11:31,047 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-06-10 12:11:31,066 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:31,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:31,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:31,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:31,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:31,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812147752] [2021-06-10 12:11:31,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:31,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-10 12:11:31,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297871402] [2021-06-10 12:11:31,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 12:11:31,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 12:11:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-10 12:11:31,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 116 [2021-06-10 12:11:31,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 102 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:31,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 116 [2021-06-10 12:11:31,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:31,413 INFO L129 PetriNetUnfolder]: 259/614 cut-off events. [2021-06-10 12:11:31,413 INFO L130 PetriNetUnfolder]: For 1627/1722 co-relation queries the response was YES. [2021-06-10 12:11:31,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2120 conditions, 614 events. 259/614 cut-off events. For 1627/1722 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3204 event pairs, 81 based on Foata normal form. 21/620 useless extension candidates. Maximal degree in co-relation 2050. Up to 286 conditions per place. [2021-06-10 12:11:31,420 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 15 selfloop transitions, 13 changer transitions 29/135 dead transitions. [2021-06-10 12:11:31,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 135 transitions, 647 flow [2021-06-10 12:11:31,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-10 12:11:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-10 12:11:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1371 transitions. [2021-06-10 12:11:31,423 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8442118226600985 [2021-06-10 12:11:31,423 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1371 transitions. [2021-06-10 12:11:31,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1371 transitions. [2021-06-10 12:11:31,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:31,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1371 transitions. [2021-06-10 12:11:31,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 97.92857142857143) internal successors, (1371), 14 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,429 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,429 INFO L185 Difference]: Start difference. First operand has 130 places, 102 transitions, 301 flow. Second operand 14 states and 1371 transitions. [2021-06-10 12:11:31,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 135 transitions, 647 flow [2021-06-10 12:11:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 135 transitions, 629 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-06-10 12:11:31,435 INFO L241 Difference]: Finished difference. Result has 136 places, 104 transitions, 379 flow [2021-06-10 12:11:31,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=379, PETRI_PLACES=136, PETRI_TRANSITIONS=104} [2021-06-10 12:11:31,435 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 13 predicate places. [2021-06-10 12:11:31,435 INFO L480 AbstractCegarLoop]: Abstraction has has 136 places, 104 transitions, 379 flow [2021-06-10 12:11:31,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:31,436 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:31,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:11:31,436 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 796929647, now seen corresponding path program 1 times [2021-06-10 12:11:31,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:31,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556596726] [2021-06-10 12:11:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:31,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:31,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:31,533 INFO L142 QuantifierPusher]: treesize reduction 26, result has 51.9 percent of original size [2021-06-10 12:11:31,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-10 12:11:31,547 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-06-10 12:11:31,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 12:11:31,563 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:31,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:31,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:31,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:31,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:31,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:31,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556596726] [2021-06-10 12:11:31,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:31,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-10 12:11:31,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196623599] [2021-06-10 12:11:31,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 12:11:31,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 12:11:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-10 12:11:31,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 116 [2021-06-10 12:11:31,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 104 transitions, 379 flow. Second operand has 8 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:31,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 116 [2021-06-10 12:11:31,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:31,942 INFO L129 PetriNetUnfolder]: 262/672 cut-off events. [2021-06-10 12:11:31,942 INFO L130 PetriNetUnfolder]: For 4476/4757 co-relation queries the response was YES. [2021-06-10 12:11:31,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2930 conditions, 672 events. 262/672 cut-off events. For 4476/4757 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3576 event pairs, 67 based on Foata normal form. 21/682 useless extension candidates. Maximal degree in co-relation 2855. Up to 240 conditions per place. [2021-06-10 12:11:31,948 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 27 selfloop transitions, 8 changer transitions 37/153 dead transitions. [2021-06-10 12:11:31,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 153 transitions, 993 flow [2021-06-10 12:11:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-10 12:11:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-10 12:11:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1328 transitions. [2021-06-10 12:11:31,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8806366047745358 [2021-06-10 12:11:31,951 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1328 transitions. [2021-06-10 12:11:31,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1328 transitions. [2021-06-10 12:11:31,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:31,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1328 transitions. [2021-06-10 12:11:31,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.15384615384616) internal successors, (1328), 13 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,955 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,955 INFO L185 Difference]: Start difference. First operand has 136 places, 104 transitions, 379 flow. Second operand 13 states and 1328 transitions. [2021-06-10 12:11:31,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 153 transitions, 993 flow [2021-06-10 12:11:31,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 153 transitions, 938 flow, removed 18 selfloop flow, removed 9 redundant places. [2021-06-10 12:11:31,961 INFO L241 Difference]: Finished difference. Result has 143 places, 108 transitions, 435 flow [2021-06-10 12:11:31,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=435, PETRI_PLACES=143, PETRI_TRANSITIONS=108} [2021-06-10 12:11:31,961 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2021-06-10 12:11:31,961 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 108 transitions, 435 flow [2021-06-10 12:11:31,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 98.25) internal successors, (786), 8 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:31,962 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:31,962 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:31,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:11:31,962 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1741522153, now seen corresponding path program 2 times [2021-06-10 12:11:31,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:31,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574713684] [2021-06-10 12:11:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:32,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:32,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:32,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:32,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:11:32,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:11:32,078 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-06-10 12:11:32,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 12:11:32,094 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:32,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:32,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:32,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:32,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:32,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574713684] [2021-06-10 12:11:32,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:32,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-10 12:11:32,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578841333] [2021-06-10 12:11:32,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-10 12:11:32,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-10 12:11:32,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-10 12:11:32,126 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 116 [2021-06-10 12:11:32,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 108 transitions, 435 flow. Second operand has 10 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:32,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:32,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 116 [2021-06-10 12:11:32,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:32,478 INFO L129 PetriNetUnfolder]: 248/719 cut-off events. [2021-06-10 12:11:32,478 INFO L130 PetriNetUnfolder]: For 8045/8542 co-relation queries the response was YES. [2021-06-10 12:11:32,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 719 events. 248/719 cut-off events. For 8045/8542 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4171 event pairs, 22 based on Foata normal form. 29/737 useless extension candidates. Maximal degree in co-relation 3563. Up to 234 conditions per place. [2021-06-10 12:11:32,486 INFO L132 encePairwiseOnDemand]: 105/116 looper letters, 28 selfloop transitions, 12 changer transitions 37/156 dead transitions. [2021-06-10 12:11:32,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 156 transitions, 1287 flow [2021-06-10 12:11:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-10 12:11:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-10 12:11:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1494 transitions. [2021-06-10 12:11:32,489 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8586206896551725 [2021-06-10 12:11:32,489 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1494 transitions. [2021-06-10 12:11:32,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1494 transitions. [2021-06-10 12:11:32,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:32,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1494 transitions. [2021-06-10 12:11:32,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.6) internal successors, (1494), 15 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:32,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:32,494 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:32,494 INFO L185 Difference]: Start difference. First operand has 143 places, 108 transitions, 435 flow. Second operand 15 states and 1494 transitions. [2021-06-10 12:11:32,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 156 transitions, 1287 flow [2021-06-10 12:11:32,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 156 transitions, 1082 flow, removed 97 selfloop flow, removed 10 redundant places. [2021-06-10 12:11:32,501 INFO L241 Difference]: Finished difference. Result has 148 places, 111 transitions, 483 flow [2021-06-10 12:11:32,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=483, PETRI_PLACES=148, PETRI_TRANSITIONS=111} [2021-06-10 12:11:32,501 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 25 predicate places. [2021-06-10 12:11:32,502 INFO L480 AbstractCegarLoop]: Abstraction has has 148 places, 111 transitions, 483 flow [2021-06-10 12:11:32,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:32,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:32,502 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:32,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:11:32,502 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1922426130, now seen corresponding path program 1 times [2021-06-10 12:11:32,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:32,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069736312] [2021-06-10 12:11:32,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:32,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:32,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:32,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:32,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 12:11:32,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 12:11:32,578 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-06-10 12:11:32,579 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-06-10 12:11:32,603 INFO L142 QuantifierPusher]: treesize reduction 17, result has 75.4 percent of original size [2021-06-10 12:11:32,604 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.7 percent of original size 43 [2021-06-10 12:11:32,632 INFO L142 QuantifierPusher]: treesize reduction 38, result has 71.9 percent of original size [2021-06-10 12:11:32,634 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.7 percent of original size 88 [2021-06-10 12:11:32,662 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:32,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:32,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:32,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:32,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:32,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:32,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069736312] [2021-06-10 12:11:32,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:32,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-10 12:11:32,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960709030] [2021-06-10 12:11:32,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-10 12:11:32,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-10 12:11:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-10 12:11:32,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 116 [2021-06-10 12:11:32,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 111 transitions, 483 flow. Second operand has 12 states, 12 states have (on average 95.16666666666667) internal successors, (1142), 12 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:32,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:32,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 116 [2021-06-10 12:11:32,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:33,108 INFO L129 PetriNetUnfolder]: 188/483 cut-off events. [2021-06-10 12:11:33,108 INFO L130 PetriNetUnfolder]: For 7096/7478 co-relation queries the response was YES. [2021-06-10 12:11:33,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 483 events. 188/483 cut-off events. For 7096/7478 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2223 event pairs, 29 based on Foata normal form. 40/514 useless extension candidates. Maximal degree in co-relation 2772. Up to 219 conditions per place. [2021-06-10 12:11:33,114 INFO L132 encePairwiseOnDemand]: 104/116 looper letters, 25 selfloop transitions, 13 changer transitions 25/141 dead transitions. [2021-06-10 12:11:33,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 141 transitions, 1120 flow [2021-06-10 12:11:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-10 12:11:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-06-10 12:11:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1371 transitions. [2021-06-10 12:11:33,116 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8442118226600985 [2021-06-10 12:11:33,116 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1371 transitions. [2021-06-10 12:11:33,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1371 transitions. [2021-06-10 12:11:33,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:33,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1371 transitions. [2021-06-10 12:11:33,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 97.92857142857143) internal successors, (1371), 14 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,121 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,121 INFO L185 Difference]: Start difference. First operand has 148 places, 111 transitions, 483 flow. Second operand 14 states and 1371 transitions. [2021-06-10 12:11:33,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 141 transitions, 1120 flow [2021-06-10 12:11:33,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 926 flow, removed 91 selfloop flow, removed 12 redundant places. [2021-06-10 12:11:33,136 INFO L241 Difference]: Finished difference. Result has 147 places, 111 transitions, 457 flow [2021-06-10 12:11:33,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=457, PETRI_PLACES=147, PETRI_TRANSITIONS=111} [2021-06-10 12:11:33,136 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 24 predicate places. [2021-06-10 12:11:33,136 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 111 transitions, 457 flow [2021-06-10 12:11:33,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 95.16666666666667) internal successors, (1142), 12 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:33,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:33,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:11:33,137 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1255746829, now seen corresponding path program 1 times [2021-06-10 12:11:33,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:33,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922766606] [2021-06-10 12:11:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:33,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:33,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:33,177 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:11:33,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:11:33,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:33,193 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:11:33,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:33,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:33,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922766606] [2021-06-10 12:11:33,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:33,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:11:33,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245284614] [2021-06-10 12:11:33,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:11:33,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:11:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:11:33,203 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 116 [2021-06-10 12:11:33,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 111 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:33,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 116 [2021-06-10 12:11:33,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:33,521 INFO L129 PetriNetUnfolder]: 950/2030 cut-off events. [2021-06-10 12:11:33,522 INFO L130 PetriNetUnfolder]: For 7926/8055 co-relation queries the response was YES. [2021-06-10 12:11:33,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2030 events. 950/2030 cut-off events. For 7926/8055 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 14965 event pairs, 170 based on Foata normal form. 41/1921 useless extension candidates. Maximal degree in co-relation 6690. Up to 507 conditions per place. [2021-06-10 12:11:33,545 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 23 selfloop transitions, 19 changer transitions 0/142 dead transitions. [2021-06-10 12:11:33,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 142 transitions, 603 flow [2021-06-10 12:11:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:11:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:11:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 953 transitions. [2021-06-10 12:11:33,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9128352490421456 [2021-06-10 12:11:33,547 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 953 transitions. [2021-06-10 12:11:33,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 953 transitions. [2021-06-10 12:11:33,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:33,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 953 transitions. [2021-06-10 12:11:33,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.88888888888889) internal successors, (953), 9 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,551 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,551 INFO L185 Difference]: Start difference. First operand has 147 places, 111 transitions, 457 flow. Second operand 9 states and 953 transitions. [2021-06-10 12:11:33,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 142 transitions, 603 flow [2021-06-10 12:11:33,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 142 transitions, 550 flow, removed 12 selfloop flow, removed 16 redundant places. [2021-06-10 12:11:33,560 INFO L241 Difference]: Finished difference. Result has 138 places, 128 transitions, 538 flow [2021-06-10 12:11:33,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=538, PETRI_PLACES=138, PETRI_TRANSITIONS=128} [2021-06-10 12:11:33,560 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 15 predicate places. [2021-06-10 12:11:33,560 INFO L480 AbstractCegarLoop]: Abstraction has has 138 places, 128 transitions, 538 flow [2021-06-10 12:11:33,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:33,561 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:33,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 12:11:33,561 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 435113219, now seen corresponding path program 1 times [2021-06-10 12:11:33,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:33,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565421869] [2021-06-10 12:11:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:33,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:33,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:33,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:33,607 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:11:33,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:11:33,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:33,626 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:11:33,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:33,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:33,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:33,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565421869] [2021-06-10 12:11:33,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:33,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:11:33,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793091747] [2021-06-10 12:11:33,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:11:33,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:33,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:11:33,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:11:33,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 116 [2021-06-10 12:11:33,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 128 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:33,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 116 [2021-06-10 12:11:33,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:33,951 INFO L129 PetriNetUnfolder]: 773/1775 cut-off events. [2021-06-10 12:11:33,951 INFO L130 PetriNetUnfolder]: For 6593/8519 co-relation queries the response was YES. [2021-06-10 12:11:33,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 1775 events. 773/1775 cut-off events. For 6593/8519 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 13539 event pairs, 69 based on Foata normal form. 180/1826 useless extension candidates. Maximal degree in co-relation 6787. Up to 702 conditions per place. [2021-06-10 12:11:33,970 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 25 selfloop transitions, 37 changer transitions 0/160 dead transitions. [2021-06-10 12:11:33,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 160 transitions, 877 flow [2021-06-10 12:11:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-10 12:11:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-10 12:11:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1272 transitions. [2021-06-10 12:11:33,973 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9137931034482759 [2021-06-10 12:11:33,973 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1272 transitions. [2021-06-10 12:11:33,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1272 transitions. [2021-06-10 12:11:33,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:33,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1272 transitions. [2021-06-10 12:11:33,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,977 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,977 INFO L185 Difference]: Start difference. First operand has 138 places, 128 transitions, 538 flow. Second operand 12 states and 1272 transitions. [2021-06-10 12:11:33,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 160 transitions, 877 flow [2021-06-10 12:11:33,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 160 transitions, 875 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 12:11:33,984 INFO L241 Difference]: Finished difference. Result has 153 places, 145 transitions, 802 flow [2021-06-10 12:11:33,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=802, PETRI_PLACES=153, PETRI_TRANSITIONS=145} [2021-06-10 12:11:33,984 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 30 predicate places. [2021-06-10 12:11:33,984 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 145 transitions, 802 flow [2021-06-10 12:11:33,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:33,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:33,985 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-06-10 12:11:33,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 12:11:33,985 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash -175849496, now seen corresponding path program 1 times [2021-06-10 12:11:33,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:33,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349663481] [2021-06-10 12:11:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:34,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:34,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:34,030 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:34,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:34,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:34,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:34,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:34,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349663481] [2021-06-10 12:11:34,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:34,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:11:34,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029900550] [2021-06-10 12:11:34,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:11:34,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:11:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:11:34,055 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2021-06-10 12:11:34,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 145 transitions, 802 flow. Second operand has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:34,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:34,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2021-06-10 12:11:34,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:34,395 INFO L129 PetriNetUnfolder]: 927/2844 cut-off events. [2021-06-10 12:11:34,395 INFO L130 PetriNetUnfolder]: For 13770/17063 co-relation queries the response was YES. [2021-06-10 12:11:34,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11766 conditions, 2844 events. 927/2844 cut-off events. For 13770/17063 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 27415 event pairs, 150 based on Foata normal form. 63/2668 useless extension candidates. Maximal degree in co-relation 11685. Up to 873 conditions per place. [2021-06-10 12:11:34,425 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 15 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2021-06-10 12:11:34,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 155 transitions, 897 flow [2021-06-10 12:11:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 12:11:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 12:11:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2021-06-10 12:11:34,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9094827586206896 [2021-06-10 12:11:34,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2021-06-10 12:11:34,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2021-06-10 12:11:34,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:34,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2021-06-10 12:11:34,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:34,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:34,429 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:34,429 INFO L185 Difference]: Start difference. First operand has 153 places, 145 transitions, 802 flow. Second operand 6 states and 633 transitions. [2021-06-10 12:11:34,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 155 transitions, 897 flow [2021-06-10 12:11:34,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 802 flow, removed 38 selfloop flow, removed 4 redundant places. [2021-06-10 12:11:34,482 INFO L241 Difference]: Finished difference. Result has 158 places, 149 transitions, 765 flow [2021-06-10 12:11:34,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=158, PETRI_TRANSITIONS=149} [2021-06-10 12:11:34,482 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 35 predicate places. [2021-06-10 12:11:34,482 INFO L480 AbstractCegarLoop]: Abstraction has has 158 places, 149 transitions, 765 flow [2021-06-10 12:11:34,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:34,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:34,483 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-06-10 12:11:34,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 12:11:34,483 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1595881602, now seen corresponding path program 2 times [2021-06-10 12:11:34,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:34,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600113833] [2021-06-10 12:11:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:34,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:34,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:34,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:34,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:34,534 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:11:34,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:11:34,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:34,551 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:11:34,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:34,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:34,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:34,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600113833] [2021-06-10 12:11:34,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:34,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-10 12:11:34,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404879676] [2021-06-10 12:11:34,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 12:11:34,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 12:11:34,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-10 12:11:34,560 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 116 [2021-06-10 12:11:34,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 149 transitions, 765 flow. Second operand has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:34,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:34,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 116 [2021-06-10 12:11:34,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:35,017 INFO L129 PetriNetUnfolder]: 1229/2807 cut-off events. [2021-06-10 12:11:35,017 INFO L130 PetriNetUnfolder]: For 19043/25617 co-relation queries the response was YES. [2021-06-10 12:11:35,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12685 conditions, 2807 events. 1229/2807 cut-off events. For 19043/25617 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 24354 event pairs, 27 based on Foata normal form. 631/3177 useless extension candidates. Maximal degree in co-relation 12601. Up to 992 conditions per place. [2021-06-10 12:11:35,045 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 19 selfloop transitions, 57 changer transitions 11/180 dead transitions. [2021-06-10 12:11:35,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 180 transitions, 1296 flow [2021-06-10 12:11:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-10 12:11:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-06-10 12:11:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1591 transitions. [2021-06-10 12:11:35,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.914367816091954 [2021-06-10 12:11:35,047 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1591 transitions. [2021-06-10 12:11:35,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1591 transitions. [2021-06-10 12:11:35,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:35,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1591 transitions. [2021-06-10 12:11:35,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 106.06666666666666) internal successors, (1591), 15 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,051 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,051 INFO L185 Difference]: Start difference. First operand has 158 places, 149 transitions, 765 flow. Second operand 15 states and 1591 transitions. [2021-06-10 12:11:35,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 180 transitions, 1296 flow [2021-06-10 12:11:35,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 180 transitions, 1257 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-10 12:11:35,082 INFO L241 Difference]: Finished difference. Result has 169 places, 165 transitions, 1101 flow [2021-06-10 12:11:35,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1101, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2021-06-10 12:11:35,083 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 46 predicate places. [2021-06-10 12:11:35,083 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 1101 flow [2021-06-10 12:11:35,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:35,083 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1] [2021-06-10 12:11:35,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 12:11:35,083 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1587808106, now seen corresponding path program 1 times [2021-06-10 12:11:35,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:35,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529295160] [2021-06-10 12:11:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:35,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:35,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:35,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:35,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:35,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:35,148 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:11:35,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:11:35,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:11:35,174 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:11:35,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:35,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:35,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529295160] [2021-06-10 12:11:35,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:35,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-10 12:11:35,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010344443] [2021-06-10 12:11:35,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-10 12:11:35,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-10 12:11:35,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-10 12:11:35,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 116 [2021-06-10 12:11:35,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 1101 flow. Second operand has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:35,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 116 [2021-06-10 12:11:35,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:35,705 INFO L129 PetriNetUnfolder]: 1109/2581 cut-off events. [2021-06-10 12:11:35,705 INFO L130 PetriNetUnfolder]: For 22262/30538 co-relation queries the response was YES. [2021-06-10 12:11:35,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13148 conditions, 2581 events. 1109/2581 cut-off events. For 22262/30538 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 22814 event pairs, 7 based on Foata normal form. 568/2872 useless extension candidates. Maximal degree in co-relation 13109. Up to 909 conditions per place. [2021-06-10 12:11:35,736 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 12 selfloop transitions, 63 changer transitions 21/189 dead transitions. [2021-06-10 12:11:35,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 189 transitions, 1522 flow [2021-06-10 12:11:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-10 12:11:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-06-10 12:11:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1894 transitions. [2021-06-10 12:11:35,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.907088122605364 [2021-06-10 12:11:35,740 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1894 transitions. [2021-06-10 12:11:35,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1894 transitions. [2021-06-10 12:11:35,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:35,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1894 transitions. [2021-06-10 12:11:35,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 105.22222222222223) internal successors, (1894), 18 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 116.0) internal successors, (2204), 19 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,756 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 116.0) internal successors, (2204), 19 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,756 INFO L185 Difference]: Start difference. First operand has 169 places, 165 transitions, 1101 flow. Second operand 18 states and 1894 transitions. [2021-06-10 12:11:35,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 189 transitions, 1522 flow [2021-06-10 12:11:35,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 189 transitions, 1100 flow, removed 166 selfloop flow, removed 16 redundant places. [2021-06-10 12:11:35,916 INFO L241 Difference]: Finished difference. Result has 173 places, 164 transitions, 915 flow [2021-06-10 12:11:35,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=915, PETRI_PLACES=173, PETRI_TRANSITIONS=164} [2021-06-10 12:11:35,916 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 50 predicate places. [2021-06-10 12:11:35,916 INFO L480 AbstractCegarLoop]: Abstraction has has 173 places, 164 transitions, 915 flow [2021-06-10 12:11:35,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:35,917 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:35,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 12:11:35,917 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1234400166, now seen corresponding path program 1 times [2021-06-10 12:11:35,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:35,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220918981] [2021-06-10 12:11:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:35,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:35,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:35,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:35,967 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:35,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:35,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:35,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:35,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:35,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:35,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220918981] [2021-06-10 12:11:35,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:35,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:11:35,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909896667] [2021-06-10 12:11:35,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:11:35,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:11:35,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:11:35,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2021-06-10 12:11:35,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 164 transitions, 915 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:35,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:35,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2021-06-10 12:11:35,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:36,418 INFO L129 PetriNetUnfolder]: 1569/4162 cut-off events. [2021-06-10 12:11:36,419 INFO L130 PetriNetUnfolder]: For 11512/12844 co-relation queries the response was YES. [2021-06-10 12:11:36,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13912 conditions, 4162 events. 1569/4162 cut-off events. For 11512/12844 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 43669 event pairs, 13 based on Foata normal form. 1/3667 useless extension candidates. Maximal degree in co-relation 13828. Up to 612 conditions per place. [2021-06-10 12:11:36,459 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 9 selfloop transitions, 2 changer transitions 4/169 dead transitions. [2021-06-10 12:11:36,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 169 transitions, 957 flow [2021-06-10 12:11:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:11:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:11:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2021-06-10 12:11:36,461 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8990147783251231 [2021-06-10 12:11:36,461 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2021-06-10 12:11:36,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2021-06-10 12:11:36,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:36,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2021-06-10 12:11:36,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:36,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:36,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:36,463 INFO L185 Difference]: Start difference. First operand has 173 places, 164 transitions, 915 flow. Second operand 7 states and 730 transitions. [2021-06-10 12:11:36,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 169 transitions, 957 flow [2021-06-10 12:11:36,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 169 transitions, 823 flow, removed 19 selfloop flow, removed 20 redundant places. [2021-06-10 12:11:36,666 INFO L241 Difference]: Finished difference. Result has 162 places, 165 transitions, 800 flow [2021-06-10 12:11:36,666 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=800, PETRI_PLACES=162, PETRI_TRANSITIONS=165} [2021-06-10 12:11:36,666 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 39 predicate places. [2021-06-10 12:11:36,667 INFO L480 AbstractCegarLoop]: Abstraction has has 162 places, 165 transitions, 800 flow [2021-06-10 12:11:36,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:36,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:36,667 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:36,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 12:11:36,667 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -30172268, now seen corresponding path program 2 times [2021-06-10 12:11:36,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:36,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175726926] [2021-06-10 12:11:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:11:36,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:36,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:36,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:36,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:36,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:36,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:11:36,720 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:11:36,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:11:36,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:36,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:36,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:36,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:11:36,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:11:36,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:11:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:11:36,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175726926] [2021-06-10 12:11:36,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:11:36,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:11:36,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336893210] [2021-06-10 12:11:36,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:11:36,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:11:36,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:11:36,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:11:36,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2021-06-10 12:11:36,751 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 165 transitions, 800 flow. Second operand has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:36,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:11:36,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2021-06-10 12:11:36,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:11:37,504 INFO L129 PetriNetUnfolder]: 3181/8544 cut-off events. [2021-06-10 12:11:37,504 INFO L130 PetriNetUnfolder]: For 13676/14332 co-relation queries the response was YES. [2021-06-10 12:11:37,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24634 conditions, 8544 events. 3181/8544 cut-off events. For 13676/14332 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 102252 event pairs, 28 based on Foata normal form. 1/7596 useless extension candidates. Maximal degree in co-relation 24602. Up to 1135 conditions per place. [2021-06-10 12:11:37,560 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 9 selfloop transitions, 2 changer transitions 4/170 dead transitions. [2021-06-10 12:11:37,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 170 transitions, 848 flow [2021-06-10 12:11:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:11:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:11:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2021-06-10 12:11:37,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8990147783251231 [2021-06-10 12:11:37,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2021-06-10 12:11:37,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2021-06-10 12:11:37,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:11:37,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2021-06-10 12:11:37,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:37,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:37,564 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:37,564 INFO L185 Difference]: Start difference. First operand has 162 places, 165 transitions, 800 flow. Second operand 7 states and 730 transitions. [2021-06-10 12:11:37,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 170 transitions, 848 flow [2021-06-10 12:11:38,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 170 transitions, 837 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-06-10 12:11:38,196 INFO L241 Difference]: Finished difference. Result has 166 places, 166 transitions, 812 flow [2021-06-10 12:11:38,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=812, PETRI_PLACES=166, PETRI_TRANSITIONS=166} [2021-06-10 12:11:38,196 INFO L343 CegarLoopForPetriNet]: 123 programPoint places, 43 predicate places. [2021-06-10 12:11:38,196 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 166 transitions, 812 flow [2021-06-10 12:11:38,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:11:38,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:11:38,197 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1] [2021-06-10 12:11:38,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 12:11:38,197 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:11:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:11:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2139826578, now seen corresponding path program 3 times [2021-06-10 12:11:38,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:11:38,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540463687] [2021-06-10 12:11:38,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:11:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:11:38,220 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:11:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:11:38,248 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:11:38,273 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:11:38,274 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:11:38,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 12:11:38,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:11:38 BasicIcfg [2021-06-10 12:11:38,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:11:38,370 INFO L168 Benchmark]: Toolchain (without parser) took 11012.33 ms. Allocated memory was 341.8 MB in the beginning and 736.1 MB in the end (delta: 394.3 MB). Free memory was 304.6 MB in the beginning and 291.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 408.8 MB. Max. memory is 16.0 GB. [2021-06-10 12:11:38,370 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 341.8 MB. Free memory was 322.9 MB in the beginning and 322.9 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:11:38,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.43 ms. Allocated memory is still 341.8 MB. Free memory was 304.4 MB in the beginning and 300.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-06-10 12:11:38,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.99 ms. Allocated memory is still 341.8 MB. Free memory was 300.2 MB in the beginning and 297.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:11:38,370 INFO L168 Benchmark]: Boogie Preprocessor took 32.65 ms. Allocated memory is still 341.8 MB. Free memory was 297.0 MB in the beginning and 294.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:11:38,370 INFO L168 Benchmark]: RCFGBuilder took 1589.02 ms. Allocated memory is still 341.8 MB. Free memory was 293.9 MB in the beginning and 250.9 MB in the end (delta: 43.0 MB). Peak memory consumption was 159.4 MB. Max. memory is 16.0 GB. [2021-06-10 12:11:38,370 INFO L168 Benchmark]: TraceAbstraction took 8927.01 ms. Allocated memory was 341.8 MB in the beginning and 736.1 MB in the end (delta: 394.3 MB). Free memory was 249.8 MB in the beginning and 291.8 MB in the end (delta: -42.0 MB). Peak memory consumption was 351.2 MB. Max. memory is 16.0 GB. [2021-06-10 12:11:38,371 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 341.8 MB. Free memory was 322.9 MB in the beginning and 322.9 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 398.43 ms. Allocated memory is still 341.8 MB. Free memory was 304.4 MB in the beginning and 300.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.99 ms. Allocated memory is still 341.8 MB. Free memory was 300.2 MB in the beginning and 297.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 32.65 ms. Allocated memory is still 341.8 MB. Free memory was 297.0 MB in the beginning and 294.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1589.02 ms. Allocated memory is still 341.8 MB. Free memory was 293.9 MB in the beginning and 250.9 MB in the end (delta: 43.0 MB). Peak memory consumption was 159.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8927.01 ms. Allocated memory was 341.8 MB in the beginning and 736.1 MB in the end (delta: 394.3 MB). Free memory was 249.8 MB in the beginning and 291.8 MB in the end (delta: -42.0 MB). Peak memory consumption was 351.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t789; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t790; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t791; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] 0 pthread_t t792; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] FCALL, FORK 0 pthread_create(&t792, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 18.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8728.5ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6643.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 75.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 131 SDtfs, 416 SDslu, 459 SDs, 0 SdLazy, 986 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 798.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1654.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1101occurred in iteration=11, InterpolantAutomatonStates: 157, 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.4ms SsaConstructionTime, 436.2ms SatisfiabilityAnalysisTime, 1305.3ms InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 4292 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...