/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 20:40:01,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 20:40:01,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 20:40:01,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 20:40:01,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 20:40:01,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 20:40:01,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 20:40:01,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 20:40:01,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 20:40:01,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 20:40:01,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 20:40:01,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 20:40:01,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 20:40:01,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 20:40:01,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 20:40:01,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 20:40:01,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 20:40:01,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 20:40:01,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 20:40:01,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 20:40:01,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 20:40:01,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 20:40:01,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 20:40:01,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 20:40:01,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 20:40:01,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 20:40:01,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 20:40:01,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 20:40:01,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 20:40:01,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 20:40:01,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 20:40:01,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 20:40:01,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 20:40:01,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 20:40:01,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 20:40:01,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 20:40:01,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 20:40:01,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 20:40:01,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 20:40:01,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 20:40:01,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 20:40:01,938 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-08-12 20:40:01,973 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 20:40:01,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 20:40:01,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 20:40:01,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 20:40:01,981 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 20:40:01,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 20:40:01,981 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 20:40:01,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 20:40:01,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 20:40:01,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 20:40:01,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 20:40:01,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 20:40:01,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 20:40:01,983 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 20:40:01,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 20:40:01,984 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 20:40:01,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 20:40:01,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 20:40:01,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 20:40:01,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 20:40:01,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 20:40:01,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:40:01,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 20:40:01,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 20:40:01,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 20:40:01,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 20:40:01,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 20:40:01,985 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 20:40:01,985 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 20:40:01,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 20:40:01,986 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-08-12 20:40:02,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 20:40:02,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 20:40:02,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 20:40:02,315 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 20:40:02,316 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 20:40:02,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2021-08-12 20:40:02,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec999274b/66c3893f780645d1854d7ed74d1516ce/FLAG0580ee72a [2021-08-12 20:40:02,946 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 20:40:02,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2021-08-12 20:40:02,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec999274b/66c3893f780645d1854d7ed74d1516ce/FLAG0580ee72a [2021-08-12 20:40:03,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec999274b/66c3893f780645d1854d7ed74d1516ce [2021-08-12 20:40:03,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 20:40:03,384 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 20:40:03,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 20:40:03,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 20:40:03,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 20:40:03,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b421cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03, skipping insertion in model container [2021-08-12 20:40:03,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 20:40:03,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 20:40:03,547 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i[950,963] [2021-08-12 20:40:03,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:40:03,802 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 20:40:03,812 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i[950,963] [2021-08-12 20:40:03,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:40:03,929 INFO L208 MainTranslator]: Completed translation [2021-08-12 20:40:03,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03 WrapperNode [2021-08-12 20:40:03,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 20:40:03,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 20:40:03,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 20:40:03,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 20:40:03,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 20:40:03,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 20:40:03,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 20:40:03,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 20:40:03,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:03,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:04,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:04,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:04,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (1/1) ... [2021-08-12 20:40:04,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 20:40:04,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 20:40:04,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 20:40:04,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 20:40:04,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (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-08-12 20:40:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 20:40:04,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 20:40:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 20:40:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 20:40:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 20:40:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 20:40:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 20:40:04,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 20:40:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 20:40:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 20:40:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 20:40:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 20:40:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 20:40:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 20:40:04,103 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 20:40:06,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 20:40:06,350 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 20:40:06,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:40:06 BoogieIcfgContainer [2021-08-12 20:40:06,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 20:40:06,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 20:40:06,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 20:40:06,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 20:40:06,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 08:40:03" (1/3) ... [2021-08-12 20:40:06,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a716487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:40:06, skipping insertion in model container [2021-08-12 20:40:06,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:40:03" (2/3) ... [2021-08-12 20:40:06,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a716487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:40:06, skipping insertion in model container [2021-08-12 20:40:06,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:40:06" (3/3) ... [2021-08-12 20:40:06,362 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i [2021-08-12 20:40:06,373 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 20:40:06,374 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 20:40:06,374 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 20:40:06,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,414 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,441 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,441 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,441 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:40:06,479 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 20:40:06,505 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-12 20:40:06,534 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 20:40:06,534 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 20:40:06,534 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 20:40:06,534 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 20:40:06,534 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 20:40:06,534 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 20:40:06,535 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 20:40:06,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 20:40:06,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-08-12 20:40:06,584 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-08-12 20:40:06,584 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:40:06,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-12 20:40:06,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2021-08-12 20:40:06,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2021-08-12 20:40:06,607 INFO L129 PetriNetUnfolder]: 0/75 cut-off events. [2021-08-12 20:40:06,607 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:40:06,608 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:06,608 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:06,609 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 23508886, now seen corresponding path program 1 times [2021-08-12 20:40:06,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:06,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596072605] [2021-08-12 20:40:06,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:06,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:06,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:06,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:06,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:06,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:06,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596072605] [2021-08-12 20:40:06,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596072605] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:06,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:06,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 20:40:06,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124129679] [2021-08-12 20:40:06,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 20:40:06,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 20:40:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 20:40:06,945 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 112 [2021-08-12 20:40:06,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:06,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:06,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 112 [2021-08-12 20:40:06,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:07,052 INFO L129 PetriNetUnfolder]: 13/175 cut-off events. [2021-08-12 20:40:07,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:40:07,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 175 events. 13/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 399 event pairs, 5 based on Foata normal form. 6/171 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2021-08-12 20:40:07,057 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 6 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2021-08-12 20:40:07,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 107 transitions, 239 flow [2021-08-12 20:40:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 20:40:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 20:40:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2021-08-12 20:40:07,074 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9494047619047619 [2021-08-12 20:40:07,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2021-08-12 20:40:07,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2021-08-12 20:40:07,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:07,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2021-08-12 20:40:07,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,095 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 0 predicate places. [2021-08-12 20:40:07,095 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 239 flow [2021-08-12 20:40:07,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,095 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:07,096 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:07,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 20:40:07,096 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash -191871396, now seen corresponding path program 1 times [2021-08-12 20:40:07,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:07,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491908873] [2021-08-12 20:40:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:07,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:07,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:07,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:07,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:07,243 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:40:07,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:40:07,264 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:40:07,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:40:07,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:07,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:07,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:07,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:07,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:07,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:07,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:07,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491908873] [2021-08-12 20:40:07,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491908873] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:07,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:07,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:40:07,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989986053] [2021-08-12 20:40:07,312 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:40:07,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:40:07,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:40:07,315 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2021-08-12 20:40:07,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:07,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2021-08-12 20:40:07,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:07,925 INFO L129 PetriNetUnfolder]: 672/2001 cut-off events. [2021-08-12 20:40:07,926 INFO L130 PetriNetUnfolder]: For 243/270 co-relation queries the response was YES. [2021-08-12 20:40:07,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 2001 events. 672/2001 cut-off events. For 243/270 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15608 event pairs, 264 based on Foata normal form. 0/1916 useless extension candidates. Maximal degree in co-relation 3322. Up to 499 conditions per place. [2021-08-12 20:40:07,946 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 42 selfloop transitions, 10 changer transitions 18/157 dead transitions. [2021-08-12 20:40:07,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 157 transitions, 521 flow [2021-08-12 20:40:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:40:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:40:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2021-08-12 20:40:07,950 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8670634920634921 [2021-08-12 20:40:07,951 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2021-08-12 20:40:07,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2021-08-12 20:40:07,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:07,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2021-08-12 20:40:07,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,958 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,959 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2021-08-12 20:40:07,959 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 157 transitions, 521 flow [2021-08-12 20:40:07,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:07,960 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:07,960 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:07,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 20:40:07,960 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1028773139, now seen corresponding path program 1 times [2021-08-12 20:40:07,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:07,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540952388] [2021-08-12 20:40:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:08,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:08,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:08,137 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:40:08,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:40:08,155 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:40:08,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:40:08,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:08,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:08,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:08,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:08,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540952388] [2021-08-12 20:40:08,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540952388] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:08,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:08,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:40:08,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785511429] [2021-08-12 20:40:08,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:40:08,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:40:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:40:08,205 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 112 [2021-08-12 20:40:08,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 157 transitions, 521 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:08,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:08,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 112 [2021-08-12 20:40:08,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:08,769 INFO L129 PetriNetUnfolder]: 916/2659 cut-off events. [2021-08-12 20:40:08,770 INFO L130 PetriNetUnfolder]: For 427/670 co-relation queries the response was YES. [2021-08-12 20:40:08,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6008 conditions, 2659 events. 916/2659 cut-off events. For 427/670 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 22617 event pairs, 68 based on Foata normal form. 0/2585 useless extension candidates. Maximal degree in co-relation 5940. Up to 633 conditions per place. [2021-08-12 20:40:08,787 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 56 selfloop transitions, 15 changer transitions 100/258 dead transitions. [2021-08-12 20:40:08,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 258 transitions, 1319 flow [2021-08-12 20:40:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:40:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:40:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2021-08-12 20:40:08,790 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2021-08-12 20:40:08,790 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2021-08-12 20:40:08,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2021-08-12 20:40:08,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:08,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2021-08-12 20:40:08,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:08,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:08,796 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:08,796 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2021-08-12 20:40:08,797 INFO L482 AbstractCegarLoop]: Abstraction has has 134 places, 258 transitions, 1319 flow [2021-08-12 20:40:08,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:08,797 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:08,797 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:08,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 20:40:08,798 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:08,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1830760426, now seen corresponding path program 1 times [2021-08-12 20:40:08,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:08,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31678522] [2021-08-12 20:40:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:08,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:08,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:08,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:40:08,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:40:08,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:08,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:40:08,967 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-08-12 20:40:08,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:40:08,984 INFO L142 QuantifierPusher]: treesize reduction 9, result has 71.0 percent of original size [2021-08-12 20:40:08,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-12 20:40:09,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:09,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:40:09,008 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:40:09,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:40:09,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:09,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:09,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:09,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:09,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:09,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:09,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:09,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31678522] [2021-08-12 20:40:09,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31678522] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:09,055 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:09,055 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 20:40:09,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605764246] [2021-08-12 20:40:09,055 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 20:40:09,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 20:40:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-12 20:40:09,057 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-08-12 20:40:09,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 258 transitions, 1319 flow. Second operand has 12 states, 12 states have (on average 89.33333333333333) internal successors, (1072), 12 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:09,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:09,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-08-12 20:40:09,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:10,261 INFO L129 PetriNetUnfolder]: 1933/5252 cut-off events. [2021-08-12 20:40:10,262 INFO L130 PetriNetUnfolder]: For 1653/1931 co-relation queries the response was YES. [2021-08-12 20:40:10,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13761 conditions, 5252 events. 1933/5252 cut-off events. For 1653/1931 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 49383 event pairs, 146 based on Foata normal form. 3/5210 useless extension candidates. Maximal degree in co-relation 13684. Up to 1104 conditions per place. [2021-08-12 20:40:10,297 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 27 selfloop transitions, 16 changer transitions 327/449 dead transitions. [2021-08-12 20:40:10,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 449 transitions, 3207 flow [2021-08-12 20:40:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:40:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:40:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1484 transitions. [2021-08-12 20:40:10,302 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.828125 [2021-08-12 20:40:10,302 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1484 transitions. [2021-08-12 20:40:10,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1484 transitions. [2021-08-12 20:40:10,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:10,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1484 transitions. [2021-08-12 20:40:10,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.75) internal successors, (1484), 16 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:10,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:10,311 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:10,311 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2021-08-12 20:40:10,312 INFO L482 AbstractCegarLoop]: Abstraction has has 149 places, 449 transitions, 3207 flow [2021-08-12 20:40:10,312 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 89.33333333333333) internal successors, (1072), 12 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:10,312 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:10,312 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:10,312 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 20:40:10,313 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash 996257962, now seen corresponding path program 1 times [2021-08-12 20:40:10,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:10,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379720380] [2021-08-12 20:40:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:10,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:10,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:10,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:10,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:10,436 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:40:10,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:40:10,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:10,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:40:10,461 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:40:10,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:10,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:10,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:10,519 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:10,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379720380] [2021-08-12 20:40:10,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379720380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:10,520 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:10,520 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:40:10,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566692376] [2021-08-12 20:40:10,520 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:40:10,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:40:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:40:10,521 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2021-08-12 20:40:10,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 449 transitions, 3207 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:10,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:10,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2021-08-12 20:40:10,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:11,133 INFO L129 PetriNetUnfolder]: 1030/3388 cut-off events. [2021-08-12 20:40:11,134 INFO L130 PetriNetUnfolder]: For 819/976 co-relation queries the response was YES. [2021-08-12 20:40:11,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8066 conditions, 3388 events. 1030/3388 cut-off events. For 819/976 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 31731 event pairs, 164 based on Foata normal form. 1/3242 useless extension candidates. Maximal degree in co-relation 7986. Up to 821 conditions per place. [2021-08-12 20:40:11,162 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 24 selfloop transitions, 17 changer transitions 131/363 dead transitions. [2021-08-12 20:40:11,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 363 transitions, 2311 flow [2021-08-12 20:40:11,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:40:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:40:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2021-08-12 20:40:11,166 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9133928571428571 [2021-08-12 20:40:11,166 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1023 transitions. [2021-08-12 20:40:11,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1023 transitions. [2021-08-12 20:40:11,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:11,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1023 transitions. [2021-08-12 20:40:11,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.3) internal successors, (1023), 10 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:11,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:11,171 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:11,171 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2021-08-12 20:40:11,171 INFO L482 AbstractCegarLoop]: Abstraction has has 158 places, 363 transitions, 2311 flow [2021-08-12 20:40:11,171 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:11,172 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:11,172 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:11,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 20:40:11,172 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1794572977, now seen corresponding path program 1 times [2021-08-12 20:40:11,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:11,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269795722] [2021-08-12 20:40:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:11,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:11,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:11,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:11,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:11,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:11,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:11,290 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-12 20:40:11,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-12 20:40:11,310 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:40:11,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:40:11,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:11,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:11,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:11,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:11,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:11,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:11,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:11,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269795722] [2021-08-12 20:40:11,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269795722] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:11,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:11,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:40:11,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523364025] [2021-08-12 20:40:11,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:40:11,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:40:11,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:40:11,359 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-08-12 20:40:11,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 363 transitions, 2311 flow. Second operand has 8 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:11,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:11,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-08-12 20:40:11,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:12,267 INFO L129 PetriNetUnfolder]: 1813/5748 cut-off events. [2021-08-12 20:40:12,267 INFO L130 PetriNetUnfolder]: For 2856/3268 co-relation queries the response was YES. [2021-08-12 20:40:12,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16058 conditions, 5748 events. 1813/5748 cut-off events. For 2856/3268 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 59744 event pairs, 247 based on Foata normal form. 14/5496 useless extension candidates. Maximal degree in co-relation 15969. Up to 1606 conditions per place. [2021-08-12 20:40:12,318 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 132 selfloop transitions, 17 changer transitions 320/596 dead transitions. [2021-08-12 20:40:12,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 596 transitions, 5171 flow [2021-08-12 20:40:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-12 20:40:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-08-12 20:40:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 761 transitions. [2021-08-12 20:40:12,320 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8493303571428571 [2021-08-12 20:40:12,320 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 761 transitions. [2021-08-12 20:40:12,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 761 transitions. [2021-08-12 20:40:12,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:12,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 761 transitions. [2021-08-12 20:40:12,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,324 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,324 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 48 predicate places. [2021-08-12 20:40:12,325 INFO L482 AbstractCegarLoop]: Abstraction has has 165 places, 596 transitions, 5171 flow [2021-08-12 20:40:12,325 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,325 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:12,325 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:12,325 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 20:40:12,325 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1312967661, now seen corresponding path program 2 times [2021-08-12 20:40:12,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:12,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865126508] [2021-08-12 20:40:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:12,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:12,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:12,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:12,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:12,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:12,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:12,392 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:40:12,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:40:12,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:12,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:40:12,417 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:40:12,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:12,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:12,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:12,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:12,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865126508] [2021-08-12 20:40:12,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865126508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:12,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:12,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:40:12,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760227258] [2021-08-12 20:40:12,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:40:12,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:40:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:40:12,429 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2021-08-12 20:40:12,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 596 transitions, 5171 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:12,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2021-08-12 20:40:12,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:12,959 INFO L129 PetriNetUnfolder]: 624/2200 cut-off events. [2021-08-12 20:40:12,959 INFO L130 PetriNetUnfolder]: For 685/3219 co-relation queries the response was YES. [2021-08-12 20:40:12,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2200 events. 624/2200 cut-off events. For 685/3219 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 19373 event pairs, 31 based on Foata normal form. 313/2362 useless extension candidates. Maximal degree in co-relation 5701. Up to 406 conditions per place. [2021-08-12 20:40:12,978 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 22 selfloop transitions, 44 changer transitions 127/318 dead transitions. [2021-08-12 20:40:12,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 318 transitions, 2253 flow [2021-08-12 20:40:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:40:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:40:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1331 transitions. [2021-08-12 20:40:12,982 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9141483516483516 [2021-08-12 20:40:12,982 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1331 transitions. [2021-08-12 20:40:12,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1331 transitions. [2021-08-12 20:40:12,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:12,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1331 transitions. [2021-08-12 20:40:12,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,989 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,989 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 57 predicate places. [2021-08-12 20:40:12,989 INFO L482 AbstractCegarLoop]: Abstraction has has 174 places, 318 transitions, 2253 flow [2021-08-12 20:40:12,990 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:12,990 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:12,990 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:12,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 20:40:12,990 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:12,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:12,990 INFO L82 PathProgramCache]: Analyzing trace with hash 891023106, now seen corresponding path program 1 times [2021-08-12 20:40:12,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:12,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817307310] [2021-08-12 20:40:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:13,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:13,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:13,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:13,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:13,116 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:40:13,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:40:13,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:40:13,141 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:40:13,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:13,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:13,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:13,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817307310] [2021-08-12 20:40:13,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817307310] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:13,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:13,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:40:13,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726895531] [2021-08-12 20:40:13,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:40:13,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:40:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:40:13,155 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2021-08-12 20:40:13,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 318 transitions, 2253 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:13,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:13,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2021-08-12 20:40:13,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:13,653 INFO L129 PetriNetUnfolder]: 502/1592 cut-off events. [2021-08-12 20:40:13,653 INFO L130 PetriNetUnfolder]: For 892/5597 co-relation queries the response was YES. [2021-08-12 20:40:13,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5004 conditions, 1592 events. 502/1592 cut-off events. For 892/5597 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 13945 event pairs, 0 based on Foata normal form. 407/1873 useless extension candidates. Maximal degree in co-relation 4909. Up to 369 conditions per place. [2021-08-12 20:40:13,665 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 19 selfloop transitions, 40 changer transitions 84/244 dead transitions. [2021-08-12 20:40:13,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 244 transitions, 1649 flow [2021-08-12 20:40:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:40:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:40:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1624 transitions. [2021-08-12 20:40:13,669 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.90625 [2021-08-12 20:40:13,669 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1624 transitions. [2021-08-12 20:40:13,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1624 transitions. [2021-08-12 20:40:13,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:13,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1624 transitions. [2021-08-12 20:40:13,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.5) internal successors, (1624), 16 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:13,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:13,677 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 112.0) internal successors, (1904), 17 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:13,677 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2021-08-12 20:40:13,677 INFO L482 AbstractCegarLoop]: Abstraction has has 171 places, 244 transitions, 1649 flow [2021-08-12 20:40:13,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:13,678 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:13,678 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:13,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 20:40:13,678 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1572557863, now seen corresponding path program 1 times [2021-08-12 20:40:13,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:13,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871424994] [2021-08-12 20:40:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:13,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:13,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:13,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:13,790 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:40:13,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:40:13,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:13,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:13,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:13,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:13,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:13,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871424994] [2021-08-12 20:40:13,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871424994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:13,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:13,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:40:13,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751625669] [2021-08-12 20:40:13,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:40:13,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:13,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:40:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:40:13,834 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 112 [2021-08-12 20:40:13,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 244 transitions, 1649 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:13,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:13,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 112 [2021-08-12 20:40:13,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:14,167 INFO L129 PetriNetUnfolder]: 939/2700 cut-off events. [2021-08-12 20:40:14,167 INFO L130 PetriNetUnfolder]: For 1436/3618 co-relation queries the response was YES. [2021-08-12 20:40:14,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8676 conditions, 2700 events. 939/2700 cut-off events. For 1436/3618 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 26363 event pairs, 0 based on Foata normal form. 10/2488 useless extension candidates. Maximal degree in co-relation 8577. Up to 684 conditions per place. [2021-08-12 20:40:14,188 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 10 selfloop transitions, 1 changer transitions 114/258 dead transitions. [2021-08-12 20:40:14,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 258 transitions, 1857 flow [2021-08-12 20:40:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 20:40:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 20:40:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2021-08-12 20:40:14,190 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8915816326530612 [2021-08-12 20:40:14,190 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2021-08-12 20:40:14,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2021-08-12 20:40:14,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:14,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2021-08-12 20:40:14,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:14,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:14,194 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:14,194 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 60 predicate places. [2021-08-12 20:40:14,194 INFO L482 AbstractCegarLoop]: Abstraction has has 177 places, 258 transitions, 1857 flow [2021-08-12 20:40:14,194 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:14,194 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:14,194 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:14,195 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 20:40:14,195 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:14,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash 324179611, now seen corresponding path program 2 times [2021-08-12 20:40:14,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:14,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219960035] [2021-08-12 20:40:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:40:14,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:14,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:40:14,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:40:14,457 INFO L142 QuantifierPusher]: treesize reduction 7, result has 83.3 percent of original size [2021-08-12 20:40:14,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-08-12 20:40:14,500 INFO L142 QuantifierPusher]: treesize reduction 72, result has 60.2 percent of original size [2021-08-12 20:40:14,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 109 [2021-08-12 20:40:14,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-12 20:40:14,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-12 20:40:14,606 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:40:14,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:40:14,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:14,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:40:14,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:40:14,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:40:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 20:40:14,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:40:14,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219960035] [2021-08-12 20:40:14,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219960035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:40:14,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:40:14,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 20:40:14,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919261259] [2021-08-12 20:40:14,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 20:40:14,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:40:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 20:40:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-12 20:40:14,657 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-08-12 20:40:14,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 258 transitions, 1857 flow. Second operand has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:14,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:40:14,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-08-12 20:40:14,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:40:15,262 INFO L129 PetriNetUnfolder]: 1249/3589 cut-off events. [2021-08-12 20:40:15,262 INFO L130 PetriNetUnfolder]: For 1780/4331 co-relation queries the response was YES. [2021-08-12 20:40:15,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11617 conditions, 3589 events. 1249/3589 cut-off events. For 1780/4331 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 36898 event pairs, 0 based on Foata normal form. 3/3332 useless extension candidates. Maximal degree in co-relation 11508. Up to 955 conditions per place. [2021-08-12 20:40:15,286 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 13 selfloop transitions, 6 changer transitions 182/282 dead transitions. [2021-08-12 20:40:15,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 282 transitions, 2291 flow [2021-08-12 20:40:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 20:40:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-12 20:40:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1086 transitions. [2021-08-12 20:40:15,289 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8080357142857143 [2021-08-12 20:40:15,289 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1086 transitions. [2021-08-12 20:40:15,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1086 transitions. [2021-08-12 20:40:15,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:40:15,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1086 transitions. [2021-08-12 20:40:15,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 90.5) internal successors, (1086), 12 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:15,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:15,295 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:15,296 INFO L348 CegarLoopForPetriNet]: 117 programPoint places, 71 predicate places. [2021-08-12 20:40:15,296 INFO L482 AbstractCegarLoop]: Abstraction has has 188 places, 282 transitions, 2291 flow [2021-08-12 20:40:15,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-12 20:40:15,296 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:40:15,296 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:40:15,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 20:40:15,297 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:40:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:40:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1110733891, now seen corresponding path program 3 times [2021-08-12 20:40:15,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:40:15,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806526814] [2021-08-12 20:40:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:40:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:40:15,356 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:40:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:40:15,414 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:40:15,469 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 20:40:15,469 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 20:40:15,469 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 20:40:15,473 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 20:40:15,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 08:40:15 BasicIcfg [2021-08-12 20:40:15,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 20:40:15,657 INFO L168 Benchmark]: Toolchain (without parser) took 12272.75 ms. Allocated memory was 215.0 MB in the beginning and 1.0 GB in the end (delta: 812.6 MB). Free memory was 179.0 MB in the beginning and 531.9 MB in the end (delta: -353.0 MB). Peak memory consumption was 460.0 MB. Max. memory is 8.0 GB. [2021-08-12 20:40:15,657 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 215.0 MB. Free memory is still 197.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 20:40:15,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.33 ms. Allocated memory is still 215.0 MB. Free memory was 178.9 MB in the beginning and 173.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-12 20:40:15,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.62 ms. Allocated memory is still 215.0 MB. Free memory was 173.2 MB in the beginning and 170.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:40:15,658 INFO L168 Benchmark]: Boogie Preprocessor took 34.44 ms. Allocated memory is still 215.0 MB. Free memory was 170.5 MB in the beginning and 168.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:40:15,658 INFO L168 Benchmark]: RCFGBuilder took 2338.13 ms. Allocated memory was 215.0 MB in the beginning and 261.1 MB in the end (delta: 46.1 MB). Free memory was 168.0 MB in the beginning and 226.6 MB in the end (delta: -58.6 MB). Peak memory consumption was 114.8 MB. Max. memory is 8.0 GB. [2021-08-12 20:40:15,658 INFO L168 Benchmark]: TraceAbstraction took 9300.20 ms. Allocated memory was 261.1 MB in the beginning and 1.0 GB in the end (delta: 766.5 MB). Free memory was 226.1 MB in the beginning and 531.9 MB in the end (delta: -305.9 MB). Peak memory consumption was 460.6 MB. Max. memory is 8.0 GB. [2021-08-12 20:40:15,659 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.19 ms. Allocated memory is still 215.0 MB. Free memory is still 197.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 544.33 ms. Allocated memory is still 215.0 MB. Free memory was 178.9 MB in the beginning and 173.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 49.62 ms. Allocated memory is still 215.0 MB. Free memory was 173.2 MB in the beginning and 170.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.44 ms. Allocated memory is still 215.0 MB. Free memory was 170.5 MB in the beginning and 168.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2338.13 ms. Allocated memory was 215.0 MB in the beginning and 261.1 MB in the end (delta: 46.1 MB). Free memory was 168.0 MB in the beginning and 226.6 MB in the end (delta: -58.6 MB). Peak memory consumption was 114.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9300.20 ms. Allocated memory was 261.1 MB in the beginning and 1.0 GB in the end (delta: 766.5 MB). Free memory was 226.1 MB in the beginning and 531.9 MB in the end (delta: -305.9 MB). Peak memory consumption was 460.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L729] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L730] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L731] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L732] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L733] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L734] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L735] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L736] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L737] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L738] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L739] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L740] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L741] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L742] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L743] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t17; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t18; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t19; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L780] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L781] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8941.3ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6352.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 57.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 182 SDtfs, 399 SDslu, 661 SDs, 0 SdLazy, 670 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 750.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1560.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5171occurred in iteration=6, InterpolantAutomatonStates: 104, 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: 45.5ms SsaConstructionTime, 633.1ms SatisfiabilityAnalysisTime, 1524.7ms InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 783 ConstructedInterpolants, 0 QuantifiedInterpolants, 4836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...