/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 11:05:38,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 11:05:38,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 11:05:38,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 11:05:38,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 11:05:38,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 11:05:38,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 11:05:38,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 11:05:38,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 11:05:38,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 11:05:38,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 11:05:38,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 11:05:38,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 11:05:38,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 11:05:38,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 11:05:38,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 11:05:38,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 11:05:38,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 11:05:38,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 11:05:38,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 11:05:38,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 11:05:38,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 11:05:38,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 11:05:38,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 11:05:38,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 11:05:38,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 11:05:38,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 11:05:38,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 11:05:38,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 11:05:38,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 11:05:38,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 11:05:38,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 11:05:38,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 11:05:38,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 11:05:38,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 11:05:38,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 11:05:38,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 11:05:38,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 11:05:38,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 11:05:38,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 11:05:38,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 11:05:38,084 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-VariableLbe.epf [2021-03-24 11:05:38,110 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 11:05:38,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 11:05:38,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 11:05:38,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 11:05:38,112 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 11:05:38,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 11:05:38,113 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 11:05:38,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 11:05:38,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 11:05:38,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 11:05:38,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 11:05:38,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 11:05:38,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 11:05:38,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 11:05:38,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 11:05:38,116 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 11:05:38,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 11:05:38,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 11:05:38,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 11:05:38,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 11:05:38,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 11:05:38,353 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 11:05:38,353 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 11:05:38,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2021-03-24 11:05:38,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b92bd2e9/cc6486bce2524c5ea63c435775ae578a/FLAG09544d544 [2021-03-24 11:05:38,721 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 11:05:38,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2021-03-24 11:05:38,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b92bd2e9/cc6486bce2524c5ea63c435775ae578a/FLAG09544d544 [2021-03-24 11:05:39,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b92bd2e9/cc6486bce2524c5ea63c435775ae578a [2021-03-24 11:05:39,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 11:05:39,111 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 11:05:39,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 11:05:39,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 11:05:39,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 11:05:39,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7be7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39, skipping insertion in model container [2021-03-24 11:05:39,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 11:05:39,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 11:05:39,248 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/safe024_power.oepc.i[995,1008] [2021-03-24 11:05:39,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 11:05:39,407 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 11:05:39,417 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/safe024_power.oepc.i[995,1008] [2021-03-24 11:05:39,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 11:05:39,513 INFO L208 MainTranslator]: Completed translation [2021-03-24 11:05:39,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39 WrapperNode [2021-03-24 11:05:39,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 11:05:39,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 11:05:39,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 11:05:39,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 11:05:39,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 11:05:39,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 11:05:39,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 11:05:39,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 11:05:39,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... [2021-03-24 11:05:39,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 11:05:39,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 11:05:39,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 11:05:39,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 11:05:39,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 11:05:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 11:05:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 11:05:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 11:05:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 11:05:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 11:05:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 11:05:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 11:05:39,664 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 11:05:41,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 11:05:41,145 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 11:05:41,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 11:05:41 BoogieIcfgContainer [2021-03-24 11:05:41,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 11:05:41,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 11:05:41,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 11:05:41,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 11:05:41,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 11:05:39" (1/3) ... [2021-03-24 11:05:41,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6efdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 11:05:41, skipping insertion in model container [2021-03-24 11:05:41,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 11:05:39" (2/3) ... [2021-03-24 11:05:41,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6efdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 11:05:41, skipping insertion in model container [2021-03-24 11:05:41,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 11:05:41" (3/3) ... [2021-03-24 11:05:41,151 INFO L111 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2021-03-24 11:05:41,155 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 11:05:41,157 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 11:05:41,158 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 11:05:41,202 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 11:05:41,213 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-24 11:05:41,225 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 11:05:41,225 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 11:05:41,225 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 11:05:41,225 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 11:05:41,225 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 11:05:41,225 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 11:05:41,225 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 11:05:41,225 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 11:05:41,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-24 11:05:41,253 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-24 11:05:41,253 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:05:41,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-24 11:05:41,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-24 11:05:41,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-24 11:05:41,259 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 11:05:41,265 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-24 11:05:41,266 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-24 11:05:41,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-24 11:05:41,278 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-24 11:05:41,278 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:05:41,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-24 11:05:41,280 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-24 11:05:41,844 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 11:05:42,219 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-24 11:05:42,339 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-24 11:05:43,239 INFO L154 LiptonReduction]: Checked pairs total: 2411 [2021-03-24 11:05:43,239 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-24 11:05:43,241 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1983 [2021-03-24 11:05:43,250 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-24 11:05:43,251 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:05:43,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:43,252 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:05:43,253 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1477082280, now seen corresponding path program 1 times [2021-03-24 11:05:43,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:43,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576989249] [2021-03-24 11:05:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:43,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:43,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:43,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576989249] [2021-03-24 11:05:43,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:43,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 11:05:43,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906825860] [2021-03-24 11:05:43,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 11:05:43,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 11:05:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 11:05:43,459 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 162 [2021-03-24 11:05:43,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:43,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 162 [2021-03-24 11:05:43,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:43,501 INFO L129 PetriNetUnfolder]: 29/110 cut-off events. [2021-03-24 11:05:43,501 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:05:43,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 110 events. 29/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 395 event pairs, 5 based on Foata normal form. 9/110 useless extension candidates. Maximal degree in co-relation 155. Up to 41 conditions per place. [2021-03-24 11:05:43,502 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 7 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-03-24 11:05:43,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 103 flow [2021-03-24 11:05:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 11:05:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 11:05:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2021-03-24 11:05:43,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2021-03-24 11:05:43,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2021-03-24 11:05:43,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2021-03-24 11:05:43,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:43,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2021-03-24 11:05:43,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,523 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 441 transitions. [2021-03-24 11:05:43,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 103 flow [2021-03-24 11:05:43,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-24 11:05:43,526 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-24 11:05:43,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-24 11:05:43,527 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-24 11:05:43,527 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2021-03-24 11:05:43,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,528 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:43,528 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] [2021-03-24 11:05:43,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 11:05:43,528 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1909478695, now seen corresponding path program 1 times [2021-03-24 11:05:43,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:43,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231944037] [2021-03-24 11:05:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:43,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:43,612 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-24 11:05:43,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:05:43,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:43,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231944037] [2021-03-24 11:05:43,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:43,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 11:05:43,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407975886] [2021-03-24 11:05:43,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:05:43,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:05:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:05:43,639 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162 [2021-03-24 11:05:43,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:43,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162 [2021-03-24 11:05:43,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:43,712 INFO L129 PetriNetUnfolder]: 21/110 cut-off events. [2021-03-24 11:05:43,712 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 11:05:43,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 110 events. 21/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 470 event pairs, 11 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 157. Up to 38 conditions per place. [2021-03-24 11:05:43,714 INFO L132 encePairwiseOnDemand]: 156/162 looper letters, 5 selfloop transitions, 3 changer transitions 11/44 dead transitions. [2021-03-24 11:05:43,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 130 flow [2021-03-24 11:05:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:05:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:05:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2021-03-24 11:05:43,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2021-03-24 11:05:43,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2021-03-24 11:05:43,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2021-03-24 11:05:43,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:43,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2021-03-24 11:05:43,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,722 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,722 INFO L185 Difference]: Start difference. First operand has 44 places, 35 transitions, 80 flow. Second operand 5 states and 698 transitions. [2021-03-24 11:05:43,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 130 flow [2021-03-24 11:05:43,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 11:05:43,723 INFO L241 Difference]: Finished difference. Result has 49 places, 33 transitions, 95 flow [2021-03-24 11:05:43,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2021-03-24 11:05:43,724 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2021-03-24 11:05:43,724 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 95 flow [2021-03-24 11:05:43,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:43,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:05:43,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 11:05:43,724 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -271287932, now seen corresponding path program 1 times [2021-03-24 11:05:43,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:43,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295670572] [2021-03-24 11:05:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:43,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:43,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:43,789 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-24 11:05:43,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:05:43,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:43,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:43,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295670572] [2021-03-24 11:05:43,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:43,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:05:43,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748781796] [2021-03-24 11:05:43,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:05:43,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:05:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:05:43,815 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 162 [2021-03-24 11:05:43,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:43,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 162 [2021-03-24 11:05:43,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:43,928 INFO L129 PetriNetUnfolder]: 48/148 cut-off events. [2021-03-24 11:05:43,929 INFO L130 PetriNetUnfolder]: For 89/134 co-relation queries the response was YES. [2021-03-24 11:05:43,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 148 events. 48/148 cut-off events. For 89/134 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 603 event pairs, 4 based on Foata normal form. 13/157 useless extension candidates. Maximal degree in co-relation 320. Up to 45 conditions per place. [2021-03-24 11:05:43,931 INFO L132 encePairwiseOnDemand]: 154/162 looper letters, 12 selfloop transitions, 12 changer transitions 12/59 dead transitions. [2021-03-24 11:05:43,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 275 flow [2021-03-24 11:05:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 11:05:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 11:05:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1217 transitions. [2021-03-24 11:05:43,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8347050754458162 [2021-03-24 11:05:43,934 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1217 transitions. [2021-03-24 11:05:43,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1217 transitions. [2021-03-24 11:05:43,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:43,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1217 transitions. [2021-03-24 11:05:43,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.22222222222223) internal successors, (1217), 9 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,939 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,939 INFO L185 Difference]: Start difference. First operand has 49 places, 33 transitions, 95 flow. Second operand 9 states and 1217 transitions. [2021-03-24 11:05:43,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 275 flow [2021-03-24 11:05:43,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 262 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-24 11:05:43,942 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 196 flow [2021-03-24 11:05:43,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=196, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-24 11:05:43,942 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2021-03-24 11:05:43,942 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 196 flow [2021-03-24 11:05:43,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:43,943 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:43,943 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] [2021-03-24 11:05:43,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 11:05:43,943 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1057409018, now seen corresponding path program 1 times [2021-03-24 11:05:43,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:43,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807341462] [2021-03-24 11:05:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:44,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:44,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807341462] [2021-03-24 11:05:44,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:44,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 11:05:44,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553230074] [2021-03-24 11:05:44,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 11:05:44,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 11:05:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 11:05:44,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 162 [2021-03-24 11:05:44,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:44,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 162 [2021-03-24 11:05:44,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:44,102 INFO L129 PetriNetUnfolder]: 22/104 cut-off events. [2021-03-24 11:05:44,102 INFO L130 PetriNetUnfolder]: For 297/349 co-relation queries the response was YES. [2021-03-24 11:05:44,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 104 events. 22/104 cut-off events. For 297/349 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 370 event pairs, 2 based on Foata normal form. 4/106 useless extension candidates. Maximal degree in co-relation 320. Up to 34 conditions per place. [2021-03-24 11:05:44,103 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 2 selfloop transitions, 5 changer transitions 3/44 dead transitions. [2021-03-24 11:05:44,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 242 flow [2021-03-24 11:05:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:05:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:05:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2021-03-24 11:05:44,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8802469135802469 [2021-03-24 11:05:44,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2021-03-24 11:05:44,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2021-03-24 11:05:44,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:44,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2021-03-24 11:05:44,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,108 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,108 INFO L185 Difference]: Start difference. First operand has 56 places, 41 transitions, 196 flow. Second operand 5 states and 713 transitions. [2021-03-24 11:05:44,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 242 flow [2021-03-24 11:05:44,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 214 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-24 11:05:44,114 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 193 flow [2021-03-24 11:05:44,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-24 11:05:44,114 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2021-03-24 11:05:44,114 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 193 flow [2021-03-24 11:05:44,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:44,115 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] [2021-03-24 11:05:44,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 11:05:44,115 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 179992846, now seen corresponding path program 1 times [2021-03-24 11:05:44,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:44,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94441599] [2021-03-24 11:05:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:44,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,183 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-24 11:05:44,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 11:05:44,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:44,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94441599] [2021-03-24 11:05:44,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:44,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 11:05:44,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289250414] [2021-03-24 11:05:44,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 11:05:44,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 11:05:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 11:05:44,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 162 [2021-03-24 11:05:44,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:44,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 162 [2021-03-24 11:05:44,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:44,274 INFO L129 PetriNetUnfolder]: 25/104 cut-off events. [2021-03-24 11:05:44,275 INFO L130 PetriNetUnfolder]: For 293/400 co-relation queries the response was YES. [2021-03-24 11:05:44,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 104 events. 25/104 cut-off events. For 293/400 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 382 event pairs, 4 based on Foata normal form. 12/115 useless extension candidates. Maximal degree in co-relation 335. Up to 38 conditions per place. [2021-03-24 11:05:44,275 INFO L132 encePairwiseOnDemand]: 156/162 looper letters, 6 selfloop transitions, 6 changer transitions 17/52 dead transitions. [2021-03-24 11:05:44,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 355 flow [2021-03-24 11:05:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-24 11:05:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-24 11:05:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2021-03-24 11:05:44,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2021-03-24 11:05:44,278 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2021-03-24 11:05:44,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2021-03-24 11:05:44,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:44,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2021-03-24 11:05:44,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,281 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,281 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 193 flow. Second operand 6 states and 808 transitions. [2021-03-24 11:05:44,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 355 flow [2021-03-24 11:05:44,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 329 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-03-24 11:05:44,283 INFO L241 Difference]: Finished difference. Result has 57 places, 35 transitions, 164 flow [2021-03-24 11:05:44,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2021-03-24 11:05:44,284 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-24 11:05:44,284 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 164 flow [2021-03-24 11:05:44,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:44,284 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 11:05:44,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 11:05:44,284 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1587661764, now seen corresponding path program 1 times [2021-03-24 11:05:44,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:44,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104080219] [2021-03-24 11:05:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:44,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:05:44,345 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:05:44,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:44,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:44,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104080219] [2021-03-24 11:05:44,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:44,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 11:05:44,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595257952] [2021-03-24 11:05:44,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:05:44,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:05:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:05:44,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162 [2021-03-24 11:05:44,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:44,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162 [2021-03-24 11:05:44,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:44,441 INFO L129 PetriNetUnfolder]: 83/202 cut-off events. [2021-03-24 11:05:44,442 INFO L130 PetriNetUnfolder]: For 333/351 co-relation queries the response was YES. [2021-03-24 11:05:44,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 202 events. 83/202 cut-off events. For 333/351 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 931 event pairs, 32 based on Foata normal form. 12/202 useless extension candidates. Maximal degree in co-relation 524. Up to 85 conditions per place. [2021-03-24 11:05:44,444 INFO L132 encePairwiseOnDemand]: 155/162 looper letters, 10 selfloop transitions, 11 changer transitions 4/53 dead transitions. [2021-03-24 11:05:44,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 250 flow [2021-03-24 11:05:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 11:05:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 11:05:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 979 transitions. [2021-03-24 11:05:44,447 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86331569664903 [2021-03-24 11:05:44,447 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 979 transitions. [2021-03-24 11:05:44,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 979 transitions. [2021-03-24 11:05:44,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:44,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 979 transitions. [2021-03-24 11:05:44,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,450 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,450 INFO L185 Difference]: Start difference. First operand has 57 places, 35 transitions, 164 flow. Second operand 7 states and 979 transitions. [2021-03-24 11:05:44,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 250 flow [2021-03-24 11:05:44,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 219 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-24 11:05:44,452 INFO L241 Difference]: Finished difference. Result has 57 places, 45 transitions, 216 flow [2021-03-24 11:05:44,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2021-03-24 11:05:44,452 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2021-03-24 11:05:44,452 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 216 flow [2021-03-24 11:05:44,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:44,453 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] [2021-03-24 11:05:44,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 11:05:44,454 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1438985673, now seen corresponding path program 1 times [2021-03-24 11:05:44,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:44,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568353535] [2021-03-24 11:05:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:44,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:05:44,529 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:05:44,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:44,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:44,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568353535] [2021-03-24 11:05:44,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:44,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 11:05:44,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602535520] [2021-03-24 11:05:44,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 11:05:44,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 11:05:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 11:05:44,537 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162 [2021-03-24 11:05:44,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:44,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162 [2021-03-24 11:05:44,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:44,641 INFO L129 PetriNetUnfolder]: 57/162 cut-off events. [2021-03-24 11:05:44,641 INFO L130 PetriNetUnfolder]: For 366/542 co-relation queries the response was YES. [2021-03-24 11:05:44,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 162 events. 57/162 cut-off events. For 366/542 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 655 event pairs, 6 based on Foata normal form. 61/218 useless extension candidates. Maximal degree in co-relation 598. Up to 78 conditions per place. [2021-03-24 11:05:44,642 INFO L132 encePairwiseOnDemand]: 155/162 looper letters, 6 selfloop transitions, 22 changer transitions 8/64 dead transitions. [2021-03-24 11:05:44,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 425 flow [2021-03-24 11:05:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 11:05:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 11:05:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1396 transitions. [2021-03-24 11:05:44,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2021-03-24 11:05:44,645 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1396 transitions. [2021-03-24 11:05:44,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1396 transitions. [2021-03-24 11:05:44,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:44,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1396 transitions. [2021-03-24 11:05:44,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 139.6) internal successors, (1396), 10 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 162.0) internal successors, (1782), 11 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,650 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 162.0) internal successors, (1782), 11 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,650 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 216 flow. Second operand 10 states and 1396 transitions. [2021-03-24 11:05:44,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 425 flow [2021-03-24 11:05:44,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-24 11:05:44,653 INFO L241 Difference]: Finished difference. Result has 70 places, 56 transitions, 375 flow [2021-03-24 11:05:44,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=375, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2021-03-24 11:05:44,654 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2021-03-24 11:05:44,654 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 375 flow [2021-03-24 11:05:44,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,654 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:44,654 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] [2021-03-24 11:05:44,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 11:05:44,654 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash -571026667, now seen corresponding path program 1 times [2021-03-24 11:05:44,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:44,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834540976] [2021-03-24 11:05:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:44,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 11:05:44,743 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 11:05:44,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:44,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:44,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834540976] [2021-03-24 11:05:44,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:44,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 11:05:44,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038613827] [2021-03-24 11:05:44,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 11:05:44,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 11:05:44,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 11:05:44,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162 [2021-03-24 11:05:44,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 375 flow. Second operand has 7 states, 7 states have (on average 136.85714285714286) internal successors, (958), 7 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:44,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162 [2021-03-24 11:05:44,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:44,863 INFO L129 PetriNetUnfolder]: 34/123 cut-off events. [2021-03-24 11:05:44,863 INFO L130 PetriNetUnfolder]: For 658/998 co-relation queries the response was YES. [2021-03-24 11:05:44,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 123 events. 34/123 cut-off events. For 658/998 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 457 event pairs, 0 based on Foata normal form. 84/203 useless extension candidates. Maximal degree in co-relation 574. Up to 58 conditions per place. [2021-03-24 11:05:44,864 INFO L132 encePairwiseOnDemand]: 155/162 looper letters, 3 selfloop transitions, 27 changer transitions 9/67 dead transitions. [2021-03-24 11:05:44,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 67 transitions, 554 flow [2021-03-24 11:05:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 11:05:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 11:05:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1804 transitions. [2021-03-24 11:05:44,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8566001899335233 [2021-03-24 11:05:44,868 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1804 transitions. [2021-03-24 11:05:44,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1804 transitions. [2021-03-24 11:05:44,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:44,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1804 transitions. [2021-03-24 11:05:44,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 138.76923076923077) internal successors, (1804), 13 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 162.0) internal successors, (2268), 14 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,874 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 162.0) internal successors, (2268), 14 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,875 INFO L185 Difference]: Start difference. First operand has 70 places, 56 transitions, 375 flow. Second operand 13 states and 1804 transitions. [2021-03-24 11:05:44,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 67 transitions, 554 flow [2021-03-24 11:05:44,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 67 transitions, 479 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-03-24 11:05:44,878 INFO L241 Difference]: Finished difference. Result has 83 places, 58 transitions, 396 flow [2021-03-24 11:05:44,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=396, PETRI_PLACES=83, PETRI_TRANSITIONS=58} [2021-03-24 11:05:44,879 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2021-03-24 11:05:44,879 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 58 transitions, 396 flow [2021-03-24 11:05:44,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 136.85714285714286) internal successors, (958), 7 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,879 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:44,879 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] [2021-03-24 11:05:44,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 11:05:44,879 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1295393607, now seen corresponding path program 1 times [2021-03-24 11:05:44,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:44,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594362216] [2021-03-24 11:05:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 11:05:44,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 11:05:44,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 11:05:44,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 11:05:44,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 11:05:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 11:05:44,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594362216] [2021-03-24 11:05:44,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 11:05:44,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 11:05:44,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340333039] [2021-03-24 11:05:44,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 11:05:44,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 11:05:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 11:05:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 11:05:44,961 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162 [2021-03-24 11:05:44,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 58 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 11:05:44,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162 [2021-03-24 11:05:44,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 11:05:44,994 INFO L129 PetriNetUnfolder]: 41/158 cut-off events. [2021-03-24 11:05:44,994 INFO L130 PetriNetUnfolder]: For 437/462 co-relation queries the response was YES. [2021-03-24 11:05:44,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 158 events. 41/158 cut-off events. For 437/462 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 755 event pairs, 0 based on Foata normal form. 3/154 useless extension candidates. Maximal degree in co-relation 627. Up to 33 conditions per place. [2021-03-24 11:05:44,995 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 5 selfloop transitions, 1 changer transitions 23/60 dead transitions. [2021-03-24 11:05:44,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 60 transitions, 422 flow [2021-03-24 11:05:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 11:05:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 11:05:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2021-03-24 11:05:44,997 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8506172839506173 [2021-03-24 11:05:44,997 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2021-03-24 11:05:44,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2021-03-24 11:05:44,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 11:05:44,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2021-03-24 11:05:44,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,999 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:44,999 INFO L185 Difference]: Start difference. First operand has 83 places, 58 transitions, 396 flow. Second operand 5 states and 689 transitions. [2021-03-24 11:05:44,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 60 transitions, 422 flow [2021-03-24 11:05:45,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 60 transitions, 327 flow, removed 22 selfloop flow, removed 13 redundant places. [2021-03-24 11:05:45,002 INFO L241 Difference]: Finished difference. Result has 75 places, 37 transitions, 175 flow [2021-03-24 11:05:45,003 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=75, PETRI_TRANSITIONS=37} [2021-03-24 11:05:45,003 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2021-03-24 11:05:45,003 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 37 transitions, 175 flow [2021-03-24 11:05:45,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 11:05:45,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 11:05:45,003 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] [2021-03-24 11:05:45,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 11:05:45,003 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 11:05:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 11:05:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash 360453271, now seen corresponding path program 2 times [2021-03-24 11:05:45,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 11:05:45,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546310774] [2021-03-24 11:05:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 11:05:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 11:05:45,044 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 11:05:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 11:05:45,081 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 11:05:45,117 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 11:05:45,117 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 11:05:45,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 11:05:45,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 11:05:45 BasicIcfg [2021-03-24 11:05:45,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 11:05:45,191 INFO L168 Benchmark]: Toolchain (without parser) took 6079.84 ms. Allocated memory was 358.6 MB in the beginning and 463.5 MB in the end (delta: 104.9 MB). Free memory was 321.8 MB in the beginning and 281.7 MB in the end (delta: 40.1 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. [2021-03-24 11:05:45,191 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 358.6 MB. Free memory was 339.9 MB in the beginning and 339.8 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 11:05:45,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.05 ms. Allocated memory is still 358.6 MB. Free memory was 321.7 MB in the beginning and 318.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.0 GB. [2021-03-24 11:05:45,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.29 ms. Allocated memory is still 358.6 MB. Free memory was 318.4 MB in the beginning and 315.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-24 11:05:45,194 INFO L168 Benchmark]: Boogie Preprocessor took 33.08 ms. Allocated memory is still 358.6 MB. Free memory was 315.2 MB in the beginning and 313.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 11:05:45,196 INFO L168 Benchmark]: RCFGBuilder took 1539.90 ms. Allocated memory is still 358.6 MB. Free memory was 313.1 MB in the beginning and 297.7 MB in the end (delta: 15.5 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. [2021-03-24 11:05:45,196 INFO L168 Benchmark]: TraceAbstraction took 4042.88 ms. Allocated memory was 358.6 MB in the beginning and 463.5 MB in the end (delta: 104.9 MB). Free memory was 297.7 MB in the beginning and 281.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 121.8 MB. Max. memory is 16.0 GB. [2021-03-24 11:05:45,200 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.09 ms. Allocated memory is still 358.6 MB. Free memory was 339.9 MB in the beginning and 339.8 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 395.05 ms. Allocated memory is still 358.6 MB. Free memory was 321.7 MB in the beginning and 318.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.29 ms. Allocated memory is still 358.6 MB. Free memory was 318.4 MB in the beginning and 315.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.08 ms. Allocated memory is still 358.6 MB. Free memory was 315.2 MB in the beginning and 313.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1539.90 ms. Allocated memory is still 358.6 MB. Free memory was 313.1 MB in the beginning and 297.7 MB in the end (delta: 15.5 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4042.88 ms. Allocated memory was 358.6 MB in the beginning and 463.5 MB in the end (delta: 104.9 MB). Free memory was 297.7 MB in the beginning and 281.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 121.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1972.8ms, 103 PlacesBefore, 47 PlacesAfterwards, 95 TransitionsBefore, 38 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2411 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1201, positive: 1139, positive conditional: 0, positive unconditional: 1139, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 752, positive: 726, positive conditional: 0, positive unconditional: 726, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 752, positive: 726, positive conditional: 0, positive unconditional: 726, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1201, positive: 413, positive conditional: 0, positive unconditional: 413, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 752, unknown conditional: 0, unknown unconditional: 752] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L756] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L757] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L758] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L760] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3894.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 799.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2020.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 87 SDslu, 68 SDs, 0 SdLazy, 220 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 174.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 362.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=8, InterpolantAutomatonStates: 63, 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: 22.5ms SsaConstructionTime, 338.4ms SatisfiabilityAnalysisTime, 481.4ms InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...