/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 09:43:35,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 09:43:35,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 09:43:35,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 09:43:35,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 09:43:35,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 09:43:35,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 09:43:35,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 09:43:35,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 09:43:35,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 09:43:35,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 09:43:35,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 09:43:35,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 09:43:35,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 09:43:35,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 09:43:35,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 09:43:35,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 09:43:35,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 09:43:35,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 09:43:35,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 09:43:35,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 09:43:35,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 09:43:35,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 09:43:35,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 09:43:35,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 09:43:35,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 09:43:35,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 09:43:35,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 09:43:35,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 09:43:35,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 09:43:35,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 09:43:35,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 09:43:35,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 09:43:35,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 09:43:35,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 09:43:35,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 09:43:35,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 09:43:35,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 09:43:35,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 09:43:35,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 09:43:35,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 09:43:35,345 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-FA-NoLbe-Separate.epf [2021-06-05 09:43:35,376 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 09:43:35,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 09:43:35,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 09:43:35,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 09:43:35,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 09:43:35,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 09:43:35,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 09:43:35,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:43:35,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 09:43:35,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 09:43:35,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 09:43:35,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 09:43:35,380 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 09:43:35,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 09:43:35,380 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 09:43:35,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 09:43:35,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 09:43:35,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 09:43:35,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 09:43:35,639 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 09:43:35,641 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 09:43:35,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-06-05 09:43:35,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7688e79/ba84eeb0da044ba0be25c3f486426188/FLAG2495347a6 [2021-06-05 09:43:36,124 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 09:43:36,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-06-05 09:43:36,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7688e79/ba84eeb0da044ba0be25c3f486426188/FLAG2495347a6 [2021-06-05 09:43:36,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb7688e79/ba84eeb0da044ba0be25c3f486426188 [2021-06-05 09:43:36,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 09:43:36,488 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 09:43:36,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 09:43:36,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 09:43:36,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 09:43:36,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:36,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295341eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36, skipping insertion in model container [2021-06-05 09:43:36,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:36,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 09:43:36,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 09:43:36,656 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/mix037_tso.oepc.i[949,962] [2021-06-05 09:43:36,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:43:36,832 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 09:43:36,840 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/mix037_tso.oepc.i[949,962] [2021-06-05 09:43:36,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:43:36,936 INFO L208 MainTranslator]: Completed translation [2021-06-05 09:43:36,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36 WrapperNode [2021-06-05 09:43:36,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 09:43:36,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 09:43:36,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 09:43:36,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 09:43:36,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:36,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:36,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 09:43:36,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 09:43:36,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 09:43:36,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 09:43:36,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:36,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:37,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:37,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:37,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:37,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:37,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... [2021-06-05 09:43:37,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 09:43:37,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 09:43:37,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 09:43:37,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 09:43:37,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 09:43:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 09:43:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 09:43:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 09:43:37,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 09:43:37,106 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-05 09:43:37,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-05 09:43:37,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 09:43:37,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 09:43:37,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 09:43:37,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 09:43:37,107 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 09:43:38,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 09:43:38,563 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 09:43:38,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:43:38 BoogieIcfgContainer [2021-06-05 09:43:38,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 09:43:38,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 09:43:38,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 09:43:38,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 09:43:38,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 09:43:36" (1/3) ... [2021-06-05 09:43:38,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c12791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:43:38, skipping insertion in model container [2021-06-05 09:43:38,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:43:36" (2/3) ... [2021-06-05 09:43:38,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c12791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:43:38, skipping insertion in model container [2021-06-05 09:43:38,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:43:38" (3/3) ... [2021-06-05 09:43:38,569 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2021-06-05 09:43:38,573 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 09:43:38,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 09:43:38,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 09:43:38,574 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,606 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,607 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,608 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,609 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,610 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:43:38,616 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:43:38,630 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-05 09:43:38,641 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:43:38,641 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:43:38,641 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:43:38,641 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:43:38,641 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:43:38,642 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:43:38,642 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:43:38,642 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:43:38,653 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143 places, 132 transitions, 284 flow [2021-06-05 09:44:25,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171678 states, 171674 states have (on average 4.54438062840034) internal successors, (780152), 171677 states have internal predecessors, (780152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 171678 states, 171674 states have (on average 4.54438062840034) internal successors, (780152), 171677 states have internal predecessors, (780152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:44:25,668 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:25,669 INFO L521 BasicCegarLoop]: 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] [2021-06-05 09:44:25,670 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1387485350, now seen corresponding path program 1 times [2021-06-05 09:44:25,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:25,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79240194] [2021-06-05 09:44:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:25,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:25,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79240194] [2021-06-05 09:44:25,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79240194] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:25,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:25,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:44:25,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966012606] [2021-06-05 09:44:25,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:44:25,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:25,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:44:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:44:26,156 INFO L87 Difference]: Start difference. First operand has 171678 states, 171674 states have (on average 4.54438062840034) internal successors, (780152), 171677 states have internal predecessors, (780152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:28,148 INFO L93 Difference]: Finished difference Result 147494 states and 657959 transitions. [2021-06-05 09:44:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:44:28,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-06-05 09:44:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:28,685 INFO L225 Difference]: With dead ends: 147494 [2021-06-05 09:44:28,685 INFO L226 Difference]: Without dead ends: 80934 [2021-06-05 09:44:28,686 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:44:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80934 states. [2021-06-05 09:44:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80934 to 80934. [2021-06-05 09:44:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80934 states, 80933 states have (on average 4.408275981367304) internal successors, (356775), 80933 states have internal predecessors, (356775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80934 states to 80934 states and 356775 transitions. [2021-06-05 09:44:32,605 INFO L78 Accepts]: Start accepts. Automaton has 80934 states and 356775 transitions. Word has length 55 [2021-06-05 09:44:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:32,606 INFO L482 AbstractCegarLoop]: Abstraction has 80934 states and 356775 transitions. [2021-06-05 09:44:32,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 80934 states and 356775 transitions. [2021-06-05 09:44:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 09:44:32,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:32,708 INFO L521 BasicCegarLoop]: 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-06-05 09:44:32,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 09:44:32,708 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash 961925361, now seen corresponding path program 1 times [2021-06-05 09:44:32,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:32,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465412367] [2021-06-05 09:44:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:32,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:32,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465412367] [2021-06-05 09:44:32,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465412367] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:32,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:32,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:44:32,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347902308] [2021-06-05 09:44:32,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:44:32,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:44:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:44:32,898 INFO L87 Difference]: Start difference. First operand 80934 states and 356775 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:33,365 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-05 09:44:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:33,857 INFO L93 Difference]: Finished difference Result 89126 states and 389543 transitions. [2021-06-05 09:44:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:44:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 09:44:33,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:34,361 INFO L225 Difference]: With dead ends: 89126 [2021-06-05 09:44:34,362 INFO L226 Difference]: Without dead ends: 68646 [2021-06-05 09:44:34,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 248.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:44:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68646 states. [2021-06-05 09:44:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68646 to 68646. [2021-06-05 09:44:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68646 states, 68645 states have (on average 4.369480661373735) internal successors, (299943), 68645 states have internal predecessors, (299943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68646 states to 68646 states and 299943 transitions. [2021-06-05 09:44:36,684 INFO L78 Accepts]: Start accepts. Automaton has 68646 states and 299943 transitions. Word has length 81 [2021-06-05 09:44:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:36,685 INFO L482 AbstractCegarLoop]: Abstraction has 68646 states and 299943 transitions. [2021-06-05 09:44:36,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 68646 states and 299943 transitions. [2021-06-05 09:44:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-06-05 09:44:36,759 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:36,759 INFO L521 BasicCegarLoop]: 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-06-05 09:44:36,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 09:44:36,759 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -176044113, now seen corresponding path program 1 times [2021-06-05 09:44:36,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:36,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986903748] [2021-06-05 09:44:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:37,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:37,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986903748] [2021-06-05 09:44:37,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986903748] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:37,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:37,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:44:37,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427390178] [2021-06-05 09:44:37,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:44:37,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:37,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:44:37,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:44:37,019 INFO L87 Difference]: Start difference. First operand 68646 states and 299943 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:37,444 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-06-05 09:44:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:38,496 INFO L93 Difference]: Finished difference Result 80358 states and 348871 transitions. [2021-06-05 09:44:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:44:38,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-06-05 09:44:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:38,817 INFO L225 Difference]: With dead ends: 80358 [2021-06-05 09:44:38,817 INFO L226 Difference]: Without dead ends: 68070 [2021-06-05 09:44:38,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 381.9ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:44:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68070 states. [2021-06-05 09:44:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68070 to 68070. [2021-06-05 09:44:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68070 states, 68069 states have (on average 4.3641452056002) internal successors, (297063), 68069 states have internal predecessors, (297063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68070 states to 68070 states and 297063 transitions. [2021-06-05 09:44:41,220 INFO L78 Accepts]: Start accepts. Automaton has 68070 states and 297063 transitions. Word has length 85 [2021-06-05 09:44:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:41,221 INFO L482 AbstractCegarLoop]: Abstraction has 68070 states and 297063 transitions. [2021-06-05 09:44:41,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 68070 states and 297063 transitions. [2021-06-05 09:44:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 09:44:41,309 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:41,309 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:44:41,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 09:44:41,309 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash -625467826, now seen corresponding path program 1 times [2021-06-05 09:44:41,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:41,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419202970] [2021-06-05 09:44:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:41,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:41,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419202970] [2021-06-05 09:44:41,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419202970] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:41,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:41,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 09:44:41,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632275363] [2021-06-05 09:44:41,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:44:41,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:41,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:44:41,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:44:41,527 INFO L87 Difference]: Start difference. First operand 68070 states and 297063 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:42,565 INFO L93 Difference]: Finished difference Result 80446 states and 349417 transitions. [2021-06-05 09:44:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:44:42,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-05 09:44:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:42,809 INFO L225 Difference]: With dead ends: 80446 [2021-06-05 09:44:42,810 INFO L226 Difference]: Without dead ends: 69822 [2021-06-05 09:44:42,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 234.9ms TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:44:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69822 states. [2021-06-05 09:44:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69822 to 69822. [2021-06-05 09:44:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69822 states, 69821 states have (on average 4.3655776915254725) internal successors, (304809), 69821 states have internal predecessors, (304809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69822 states to 69822 states and 304809 transitions. [2021-06-05 09:44:45,150 INFO L78 Accepts]: Start accepts. Automaton has 69822 states and 304809 transitions. Word has length 87 [2021-06-05 09:44:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:45,151 INFO L482 AbstractCegarLoop]: Abstraction has 69822 states and 304809 transitions. [2021-06-05 09:44:45,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69822 states and 304809 transitions. [2021-06-05 09:44:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 09:44:45,236 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:45,236 INFO L521 BasicCegarLoop]: 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-06-05 09:44:45,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 09:44:45,236 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:45,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2077370560, now seen corresponding path program 1 times [2021-06-05 09:44:45,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:45,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401406214] [2021-06-05 09:44:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:45,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:45,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401406214] [2021-06-05 09:44:45,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401406214] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:45,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:45,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:44:45,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362167736] [2021-06-05 09:44:45,366 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:44:45,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:45,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:44:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:44:45,369 INFO L87 Difference]: Start difference. First operand 69822 states and 304809 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:46,493 INFO L93 Difference]: Finished difference Result 78790 states and 342391 transitions. [2021-06-05 09:44:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:44:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-05 09:44:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:46,748 INFO L225 Difference]: With dead ends: 78790 [2021-06-05 09:44:46,748 INFO L226 Difference]: Without dead ends: 70790 [2021-06-05 09:44:46,749 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 502.1ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:44:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70790 states. [2021-06-05 09:44:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70790 to 70790. [2021-06-05 09:44:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70790 states, 70789 states have (on average 4.36710505869556) internal successors, (309143), 70789 states have internal predecessors, (309143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70790 states to 70790 states and 309143 transitions. [2021-06-05 09:44:49,133 INFO L78 Accepts]: Start accepts. Automaton has 70790 states and 309143 transitions. Word has length 88 [2021-06-05 09:44:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:49,133 INFO L482 AbstractCegarLoop]: Abstraction has 70790 states and 309143 transitions. [2021-06-05 09:44:49,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 70790 states and 309143 transitions. [2021-06-05 09:44:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:44:49,248 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:49,249 INFO L521 BasicCegarLoop]: 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, 1] [2021-06-05 09:44:49,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 09:44:49,249 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash -749418959, now seen corresponding path program 1 times [2021-06-05 09:44:49,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:49,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020310212] [2021-06-05 09:44:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:49,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:49,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020310212] [2021-06-05 09:44:49,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020310212] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:49,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:49,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:44:49,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666906944] [2021-06-05 09:44:49,473 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:44:49,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:49,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:44:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:44:49,474 INFO L87 Difference]: Start difference. First operand 70790 states and 309143 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:50,837 INFO L93 Difference]: Finished difference Result 75590 states and 328267 transitions. [2021-06-05 09:44:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:44:50,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:44:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:51,045 INFO L225 Difference]: With dead ends: 75590 [2021-06-05 09:44:51,045 INFO L226 Difference]: Without dead ends: 68166 [2021-06-05 09:44:51,046 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 173.7ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:44:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68166 states. [2021-06-05 09:44:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68166 to 66942. [2021-06-05 09:44:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66942 states, 66941 states have (on average 4.3594359211843265) internal successors, (291825), 66941 states have internal predecessors, (291825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66942 states to 66942 states and 291825 transitions. [2021-06-05 09:44:53,404 INFO L78 Accepts]: Start accepts. Automaton has 66942 states and 291825 transitions. Word has length 89 [2021-06-05 09:44:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:53,405 INFO L482 AbstractCegarLoop]: Abstraction has 66942 states and 291825 transitions. [2021-06-05 09:44:53,405 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 66942 states and 291825 transitions. [2021-06-05 09:44:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:44:53,493 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:53,494 INFO L521 BasicCegarLoop]: 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, 1] [2021-06-05 09:44:53,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 09:44:53,494 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:53,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1970371010, now seen corresponding path program 1 times [2021-06-05 09:44:53,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:53,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826147078] [2021-06-05 09:44:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:53,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:53,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826147078] [2021-06-05 09:44:53,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826147078] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:53,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:53,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:44:53,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44056949] [2021-06-05 09:44:53,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:44:53,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:44:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:44:53,561 INFO L87 Difference]: Start difference. First operand 66942 states and 291825 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:54,019 INFO L93 Difference]: Finished difference Result 82058 states and 352730 transitions. [2021-06-05 09:44:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:44:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:44:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:54,621 INFO L225 Difference]: With dead ends: 82058 [2021-06-05 09:44:54,621 INFO L226 Difference]: Without dead ends: 60234 [2021-06-05 09:44:54,621 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:44:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60234 states. [2021-06-05 09:44:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60234 to 60234. [2021-06-05 09:44:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60234 states, 60233 states have (on average 4.2880978865406005) internal successors, (258285), 60233 states have internal predecessors, (258285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60234 states to 60234 states and 258285 transitions. [2021-06-05 09:44:56,225 INFO L78 Accepts]: Start accepts. Automaton has 60234 states and 258285 transitions. Word has length 89 [2021-06-05 09:44:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:56,226 INFO L482 AbstractCegarLoop]: Abstraction has 60234 states and 258285 transitions. [2021-06-05 09:44:56,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 60234 states and 258285 transitions. [2021-06-05 09:44:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-06-05 09:44:56,305 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:56,305 INFO L521 BasicCegarLoop]: 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, 1, 1] [2021-06-05 09:44:56,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 09:44:56,305 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1367595612, now seen corresponding path program 1 times [2021-06-05 09:44:56,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:56,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208764967] [2021-06-05 09:44:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:56,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:56,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208764967] [2021-06-05 09:44:56,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208764967] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:56,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:56,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:44:56,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462166051] [2021-06-05 09:44:56,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:44:56,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:44:56,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:44:56,377 INFO L87 Difference]: Start difference. First operand 60234 states and 258285 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:57,175 INFO L93 Difference]: Finished difference Result 60978 states and 255268 transitions. [2021-06-05 09:44:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:44:57,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-06-05 09:44:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:57,312 INFO L225 Difference]: With dead ends: 60978 [2021-06-05 09:44:57,312 INFO L226 Difference]: Without dead ends: 42918 [2021-06-05 09:44:57,312 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:44:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42918 states. [2021-06-05 09:44:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42918 to 42030. [2021-06-05 09:44:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42030 states, 42029 states have (on average 4.132075471698113) internal successors, (173667), 42029 states have internal predecessors, (173667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42030 states to 42030 states and 173667 transitions. [2021-06-05 09:44:58,705 INFO L78 Accepts]: Start accepts. Automaton has 42030 states and 173667 transitions. Word has length 90 [2021-06-05 09:44:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:44:58,705 INFO L482 AbstractCegarLoop]: Abstraction has 42030 states and 173667 transitions. [2021-06-05 09:44:58,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states and 173667 transitions. [2021-06-05 09:44:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 09:44:58,767 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:44:58,767 INFO L521 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-06-05 09:44:58,767 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 09:44:58,767 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:44:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:44:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2057113485, now seen corresponding path program 1 times [2021-06-05 09:44:58,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:44:58,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708555451] [2021-06-05 09:44:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:44:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:44:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:44:58,861 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:44:58,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708555451] [2021-06-05 09:44:58,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708555451] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:44:58,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:44:58,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:44:58,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183567655] [2021-06-05 09:44:58,862 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:44:58,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:44:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:44:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:44:58,863 INFO L87 Difference]: Start difference. First operand 42030 states and 173667 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:44:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:44:59,138 INFO L93 Difference]: Finished difference Result 36306 states and 147180 transitions. [2021-06-05 09:44:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:44:59,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-05 09:44:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:44:59,206 INFO L225 Difference]: With dead ends: 36306 [2021-06-05 09:44:59,207 INFO L226 Difference]: Without dead ends: 26910 [2021-06-05 09:44:59,207 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:44:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26910 states. [2021-06-05 09:44:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26910 to 26622. [2021-06-05 09:44:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26622 states, 26621 states have (on average 4.017392284286841) internal successors, (106947), 26621 states have internal predecessors, (106947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26622 states to 26622 states and 106947 transitions. [2021-06-05 09:45:00,051 INFO L78 Accepts]: Start accepts. Automaton has 26622 states and 106947 transitions. Word has length 93 [2021-06-05 09:45:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:45:00,051 INFO L482 AbstractCegarLoop]: Abstraction has 26622 states and 106947 transitions. [2021-06-05 09:45:00,052 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26622 states and 106947 transitions. [2021-06-05 09:45:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-05 09:45:00,090 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:45:00,090 INFO L521 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:45:00,090 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 09:45:00,090 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:45:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:45:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1485659719, now seen corresponding path program 1 times [2021-06-05 09:45:00,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:45:00,091 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836200865] [2021-06-05 09:45:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:45:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:45:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:45:00,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:45:00,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836200865] [2021-06-05 09:45:00,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836200865] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:45:00,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:45:00,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:45:00,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376216421] [2021-06-05 09:45:00,175 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:45:00,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:45:00,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:45:00,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:45:00,175 INFO L87 Difference]: Start difference. First operand 26622 states and 106947 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:45:00,380 INFO L93 Difference]: Finished difference Result 37836 states and 151524 transitions. [2021-06-05 09:45:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:45:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-06-05 09:45:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:45:00,447 INFO L225 Difference]: With dead ends: 37836 [2021-06-05 09:45:00,447 INFO L226 Difference]: Without dead ends: 27432 [2021-06-05 09:45:00,448 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:45:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27432 states. [2021-06-05 09:45:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27432 to 26622. [2021-06-05 09:45:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26622 states, 26621 states have (on average 3.9680327560948125) internal successors, (105633), 26621 states have internal predecessors, (105633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26622 states to 26622 states and 105633 transitions. [2021-06-05 09:45:01,319 INFO L78 Accepts]: Start accepts. Automaton has 26622 states and 105633 transitions. Word has length 98 [2021-06-05 09:45:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:45:01,319 INFO L482 AbstractCegarLoop]: Abstraction has 26622 states and 105633 transitions. [2021-06-05 09:45:01,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 26622 states and 105633 transitions. [2021-06-05 09:45:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-05 09:45:01,359 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:45:01,359 INFO L521 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:45:01,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 09:45:01,359 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:45:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:45:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -967694875, now seen corresponding path program 2 times [2021-06-05 09:45:01,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:45:01,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039742051] [2021-06-05 09:45:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:45:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:45:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:45:01,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:45:01,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039742051] [2021-06-05 09:45:01,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039742051] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:45:01,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:45:01,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 09:45:01,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121699287] [2021-06-05 09:45:01,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:45:01,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:45:01,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:45:01,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:45:01,606 INFO L87 Difference]: Start difference. First operand 26622 states and 105633 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:45:02,112 INFO L93 Difference]: Finished difference Result 42030 states and 165000 transitions. [2021-06-05 09:45:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:45:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-06-05 09:45:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:45:02,198 INFO L225 Difference]: With dead ends: 42030 [2021-06-05 09:45:02,198 INFO L226 Difference]: Without dead ends: 34182 [2021-06-05 09:45:02,198 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 229.4ms TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:45:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34182 states. [2021-06-05 09:45:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34182 to 29042. [2021-06-05 09:45:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29042 states, 29041 states have (on average 3.9419097138528287) internal successors, (114477), 29041 states have internal predecessors, (114477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29042 states to 29042 states and 114477 transitions. [2021-06-05 09:45:03,091 INFO L78 Accepts]: Start accepts. Automaton has 29042 states and 114477 transitions. Word has length 98 [2021-06-05 09:45:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:45:03,092 INFO L482 AbstractCegarLoop]: Abstraction has 29042 states and 114477 transitions. [2021-06-05 09:45:03,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 29042 states and 114477 transitions. [2021-06-05 09:45:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-06-05 09:45:03,145 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:45:03,145 INFO L521 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:45:03,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 09:45:03,145 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:45:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:45:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash -413645787, now seen corresponding path program 3 times [2021-06-05 09:45:03,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:45:03,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133197587] [2021-06-05 09:45:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:45:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:45:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:45:03,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:45:03,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133197587] [2021-06-05 09:45:03,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133197587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:45:03,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:45:03,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:45:03,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854210007] [2021-06-05 09:45:03,239 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:45:03,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:45:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:45:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:45:03,239 INFO L87 Difference]: Start difference. First operand 29042 states and 114477 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:45:03,508 INFO L93 Difference]: Finished difference Result 25262 states and 99276 transitions. [2021-06-05 09:45:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:45:03,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-06-05 09:45:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:45:03,539 INFO L225 Difference]: With dead ends: 25262 [2021-06-05 09:45:03,539 INFO L226 Difference]: Without dead ends: 12016 [2021-06-05 09:45:03,539 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 102.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:45:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12016 states. [2021-06-05 09:45:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12016 to 10216. [2021-06-05 09:45:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10216 states, 10215 states have (on average 3.8916299559471366) internal successors, (39753), 10215 states have internal predecessors, (39753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10216 states to 10216 states and 39753 transitions. [2021-06-05 09:45:03,765 INFO L78 Accepts]: Start accepts. Automaton has 10216 states and 39753 transitions. Word has length 98 [2021-06-05 09:45:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:45:03,765 INFO L482 AbstractCegarLoop]: Abstraction has 10216 states and 39753 transitions. [2021-06-05 09:45:03,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10216 states and 39753 transitions. [2021-06-05 09:45:03,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 09:45:03,782 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:45:03,782 INFO L521 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:45:03,782 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 09:45:03,782 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:45:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:45:03,782 INFO L82 PathProgramCache]: Analyzing trace with hash 38605168, now seen corresponding path program 1 times [2021-06-05 09:45:03,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:45:03,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965178369] [2021-06-05 09:45:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:45:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:45:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:45:03,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:45:03,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965178369] [2021-06-05 09:45:03,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965178369] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:45:03,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:45:03,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:45:03,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483432513] [2021-06-05 09:45:03,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:45:03,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:45:03,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:45:03,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:45:03,867 INFO L87 Difference]: Start difference. First operand 10216 states and 39753 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:45:03,974 INFO L93 Difference]: Finished difference Result 14522 states and 55769 transitions. [2021-06-05 09:45:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:45:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-06-05 09:45:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:45:03,992 INFO L225 Difference]: With dead ends: 14522 [2021-06-05 09:45:03,993 INFO L226 Difference]: Without dead ends: 7264 [2021-06-05 09:45:03,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:45:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7264 states. [2021-06-05 09:45:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7264 to 7264. [2021-06-05 09:45:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7264 states, 7263 states have (on average 3.7509293680297398) internal successors, (27243), 7263 states have internal predecessors, (27243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 27243 transitions. [2021-06-05 09:45:04,402 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 27243 transitions. Word has length 103 [2021-06-05 09:45:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:45:04,402 INFO L482 AbstractCegarLoop]: Abstraction has 7264 states and 27243 transitions. [2021-06-05 09:45:04,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:45:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 27243 transitions. [2021-06-05 09:45:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 09:45:04,413 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:45:04,413 INFO L521 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:45:04,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 09:45:04,414 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:45:04,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:45:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash -346582672, now seen corresponding path program 2 times [2021-06-05 09:45:04,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:45:04,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613508281] [2021-06-05 09:45:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:45:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:45:04,446 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:45:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:45:04,483 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:45:04,514 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 09:45:04,514 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 09:45:04,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 09:45:04,516 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 09:45:04,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:45:04 BasicIcfg [2021-06-05 09:45:04,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 09:45:04,615 INFO L168 Benchmark]: Toolchain (without parser) took 88127.48 ms. Allocated memory was 362.8 MB in the beginning and 14.9 GB in the end (delta: 14.5 GB). Free memory was 325.6 MB in the beginning and 8.9 GB in the end (delta: -8.6 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB. [2021-06-05 09:45:04,615 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 362.8 MB. Free memory was 343.9 MB in the beginning and 343.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 09:45:04,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.52 ms. Allocated memory is still 362.8 MB. Free memory was 325.4 MB in the beginning and 321.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. [2021-06-05 09:45:04,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.59 ms. Allocated memory is still 362.8 MB. Free memory was 321.6 MB in the beginning and 318.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 09:45:04,616 INFO L168 Benchmark]: Boogie Preprocessor took 40.38 ms. Allocated memory is still 362.8 MB. Free memory was 318.4 MB in the beginning and 316.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:45:04,616 INFO L168 Benchmark]: RCFGBuilder took 1537.41 ms. Allocated memory is still 362.8 MB. Free memory was 316.3 MB in the beginning and 222.7 MB in the end (delta: 93.6 MB). Peak memory consumption was 148.9 MB. Max. memory is 16.0 GB. [2021-06-05 09:45:04,616 INFO L168 Benchmark]: TraceAbstraction took 86049.78 ms. Allocated memory was 362.8 MB in the beginning and 14.9 GB in the end (delta: 14.5 GB). Free memory was 222.7 MB in the beginning and 8.9 GB in the end (delta: -8.7 GB). Peak memory consumption was 5.8 GB. Max. memory is 16.0 GB. [2021-06-05 09:45:04,616 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 362.8 MB. Free memory was 343.9 MB in the beginning and 343.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 435.52 ms. Allocated memory is still 362.8 MB. Free memory was 325.4 MB in the beginning and 321.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.59 ms. Allocated memory is still 362.8 MB. Free memory was 321.6 MB in the beginning and 318.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.38 ms. Allocated memory is still 362.8 MB. Free memory was 318.4 MB in the beginning and 316.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1537.41 ms. Allocated memory is still 362.8 MB. Free memory was 316.3 MB in the beginning and 222.7 MB in the end (delta: 93.6 MB). Peak memory consumption was 148.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 86049.78 ms. Allocated memory was 362.8 MB in the beginning and 14.9 GB in the end (delta: 14.5 GB). Free memory was 222.7 MB in the beginning and 8.9 GB in the end (delta: -8.7 GB). Peak memory consumption was 5.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L730] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L732] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L735] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L738] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L741] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L744] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t993; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t994; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t996; VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 85874.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 1080.1ms, AutomataDifference: 13927.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 46780.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2379 SDtfs, 4411 SDslu, 9190 SDs, 0 SdLazy, 1160 SolverSat, 310 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1124.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2193.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=171678occurred in iteration=0, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 21957.2ms AutomataMinimizationTime, 13 MinimizatonAttempts, 10150 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.6ms SsaConstructionTime, 433.3ms SatisfiabilityAnalysisTime, 1376.9ms InterpolantComputationTime, 1257 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 6250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...