/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:35:12,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:35:12,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:35:12,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:35:12,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:35:12,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:35:12,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:35:12,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:35:12,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:35:12,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:35:12,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:35:12,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:35:12,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:35:12,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:35:12,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:35:12,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:35:12,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:35:12,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:35:13,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:35:13,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:35:13,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:35:13,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:35:13,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:35:13,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:35:13,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:35:13,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:35:13,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:35:13,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:35:13,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:35:13,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:35:13,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:35:13,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:35:13,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:35:13,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:35:13,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:35:13,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:35:13,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:35:13,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:35:13,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:35:13,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:35:13,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:35:13,038 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.epf [2021-07-13 18:35:13,075 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:35:13,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:35:13,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:35:13,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:35:13,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:35:13,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:35:13,077 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:35:13,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:35:13,077 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:35:13,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:35:13,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:35:13,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:35:13,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:35:13,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:35:13,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:35:13,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:35:13,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:35:13,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:35:13,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:35:13,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:35:13,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:35:13,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:35:13,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:35:13,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:35:13,080 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-07-13 18:35:13,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:35:13,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:35:13,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:35:13,431 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:35:13,433 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:35:13,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2021-07-13 18:35:13,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c258945/c6f498dd58a14e29b7513c2222f6c099/FLAGee8f04c11 [2021-07-13 18:35:13,946 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:35:13,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2021-07-13 18:35:13,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c258945/c6f498dd58a14e29b7513c2222f6c099/FLAGee8f04c11 [2021-07-13 18:35:14,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c258945/c6f498dd58a14e29b7513c2222f6c099 [2021-07-13 18:35:14,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:35:14,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:35:14,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:35:14,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:35:14,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:35:14,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:14,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52da940f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14, skipping insertion in model container [2021-07-13 18:35:14,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:14,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:35:14,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:35:14,509 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/mix011_tso.oepc.i[949,962] [2021-07-13 18:35:14,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:35:14,769 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:35:14,781 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/mix011_tso.oepc.i[949,962] [2021-07-13 18:35:14,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:35:14,901 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:35:14,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14 WrapperNode [2021-07-13 18:35:14,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:35:14,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:35:14,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:35:14,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:35:14,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:14,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:14,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:35:14,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:35:14,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:35:14,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:35:14,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:14,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:15,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:15,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:15,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:15,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:15,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (1/1) ... [2021-07-13 18:35:15,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:35:15,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:35:15,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:35:15,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:35:15,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (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-07-13 18:35:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:35:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:35:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:35:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:35:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-13 18:35:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-13 18:35:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-13 18:35:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-13 18:35:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-13 18:35:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-13 18:35:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:35:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:35:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:35:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:35:15,103 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:35:16,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:35:16,879 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-13 18:35:16,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:35:16 BoogieIcfgContainer [2021-07-13 18:35:16,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:35:16,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:35:16,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:35:16,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:35:16,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:35:14" (1/3) ... [2021-07-13 18:35:16,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7b480b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:35:16, skipping insertion in model container [2021-07-13 18:35:16,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:35:14" (2/3) ... [2021-07-13 18:35:16,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7b480b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:35:16, skipping insertion in model container [2021-07-13 18:35:16,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:35:16" (3/3) ... [2021-07-13 18:35:16,888 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2021-07-13 18:35:16,894 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:35:16,894 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:35:16,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 18:35:16,895 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:35:16,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,927 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,932 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,934 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,937 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,937 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,941 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,941 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,942 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,942 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,942 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:35:16,945 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-13 18:35:16,964 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-13 18:35:16,980 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:35:16,980 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:35:16,980 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:35:16,980 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:35:16,980 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:35:16,980 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:35:16,980 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:35:16,980 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:35:16,991 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2021-07-13 18:35:17,515 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13387 states, 13385 states have (on average 3.6165110197982817) internal successors, (48407), 13386 states have internal predecessors, (48407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 13387 states, 13385 states have (on average 3.6165110197982817) internal successors, (48407), 13386 states have internal predecessors, (48407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-13 18:35:17,641 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:17,642 INFO L508 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] [2021-07-13 18:35:17,642 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:17,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash -518526821, now seen corresponding path program 1 times [2021-07-13 18:35:17,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:17,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958987964] [2021-07-13 18:35:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:18,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:18,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958987964] [2021-07-13 18:35:18,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958987964] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:18,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:18,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:35:18,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920411917] [2021-07-13 18:35:18,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:35:18,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:35:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:35:18,168 INFO L87 Difference]: Start difference. First operand has 13387 states, 13385 states have (on average 3.6165110197982817) internal successors, (48407), 13386 states have internal predecessors, (48407), 0 states have call successors, (0), 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 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:18,662 INFO L93 Difference]: Finished difference Result 14395 states and 50689 transitions. [2021-07-13 18:35:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:35:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-07-13 18:35:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:18,796 INFO L225 Difference]: With dead ends: 14395 [2021-07-13 18:35:18,796 INFO L226 Difference]: Without dead ends: 9731 [2021-07-13 18:35:18,797 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 98.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:35:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2021-07-13 18:35:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 9731. [2021-07-13 18:35:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9731 states, 9730 states have (on average 3.499280575539568) internal successors, (34048), 9730 states have internal predecessors, (34048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 34048 transitions. [2021-07-13 18:35:19,444 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 34048 transitions. Word has length 71 [2021-07-13 18:35:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:19,446 INFO L482 AbstractCegarLoop]: Abstraction has 9731 states and 34048 transitions. [2021-07-13 18:35:19,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 34048 transitions. [2021-07-13 18:35:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-13 18:35:19,466 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:19,466 INFO L508 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] [2021-07-13 18:35:19,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:35:19,466 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash -990168680, now seen corresponding path program 1 times [2021-07-13 18:35:19,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:19,467 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118917699] [2021-07-13 18:35:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:19,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:19,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118917699] [2021-07-13 18:35:19,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118917699] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:19,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:19,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:35:19,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993896891] [2021-07-13 18:35:19,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:35:19,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:19,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:35:19,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:35:19,758 INFO L87 Difference]: Start difference. First operand 9731 states and 34048 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:19,965 INFO L93 Difference]: Finished difference Result 10595 states and 36772 transitions. [2021-07-13 18:35:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:35:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-07-13 18:35:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:20,033 INFO L225 Difference]: With dead ends: 10595 [2021-07-13 18:35:20,033 INFO L226 Difference]: Without dead ends: 8867 [2021-07-13 18:35:20,035 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 92.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:35:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8867 states. [2021-07-13 18:35:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8867 to 8867. [2021-07-13 18:35:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8867 states, 8866 states have (on average 3.478908188585608) internal successors, (30844), 8866 states have internal predecessors, (30844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 30844 transitions. [2021-07-13 18:35:20,505 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 30844 transitions. Word has length 75 [2021-07-13 18:35:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:20,505 INFO L482 AbstractCegarLoop]: Abstraction has 8867 states and 30844 transitions. [2021-07-13 18:35:20,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 30844 transitions. [2021-07-13 18:35:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-13 18:35:20,536 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:20,537 INFO L508 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] [2021-07-13 18:35:20,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:35:20,537 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1386993928, now seen corresponding path program 1 times [2021-07-13 18:35:20,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:20,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48642595] [2021-07-13 18:35:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:20,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:20,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48642595] [2021-07-13 18:35:20,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48642595] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:20,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:20,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:35:20,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500895675] [2021-07-13 18:35:20,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:35:20,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:20,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:35:20,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:35:20,800 INFO L87 Difference]: Start difference. First operand 8867 states and 30844 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:21,416 INFO L93 Difference]: Finished difference Result 10287 states and 35616 transitions. [2021-07-13 18:35:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:35:21,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-07-13 18:35:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:21,462 INFO L225 Difference]: With dead ends: 10287 [2021-07-13 18:35:21,462 INFO L226 Difference]: Without dead ends: 9135 [2021-07-13 18:35:21,463 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 343.0ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:35:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9135 states. [2021-07-13 18:35:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9135 to 9135. [2021-07-13 18:35:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9135 states, 9134 states have (on average 3.482373549375958) internal successors, (31808), 9134 states have internal predecessors, (31808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9135 states to 9135 states and 31808 transitions. [2021-07-13 18:35:21,858 INFO L78 Accepts]: Start accepts. Automaton has 9135 states and 31808 transitions. Word has length 78 [2021-07-13 18:35:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:21,860 INFO L482 AbstractCegarLoop]: Abstraction has 9135 states and 31808 transitions. [2021-07-13 18:35:21,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9135 states and 31808 transitions. [2021-07-13 18:35:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-13 18:35:21,886 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:21,886 INFO L508 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] [2021-07-13 18:35:21,886 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:35:21,886 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 808888302, now seen corresponding path program 2 times [2021-07-13 18:35:21,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:21,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878174967] [2021-07-13 18:35:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:22,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:22,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878174967] [2021-07-13 18:35:22,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878174967] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:22,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:22,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:35:22,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104280747] [2021-07-13 18:35:22,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:35:22,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:35:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:35:22,163 INFO L87 Difference]: Start difference. First operand 9135 states and 31808 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:22,557 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-07-13 18:35:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:22,604 INFO L93 Difference]: Finished difference Result 10743 states and 37256 transitions. [2021-07-13 18:35:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:35:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-07-13 18:35:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:22,671 INFO L225 Difference]: With dead ends: 10743 [2021-07-13 18:35:22,671 INFO L226 Difference]: Without dead ends: 9495 [2021-07-13 18:35:22,672 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 317.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:35:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9495 states. [2021-07-13 18:35:23,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9495 to 9495. [2021-07-13 18:35:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9495 states, 9494 states have (on average 3.4855698335791025) internal successors, (33092), 9494 states have internal predecessors, (33092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9495 states to 9495 states and 33092 transitions. [2021-07-13 18:35:23,143 INFO L78 Accepts]: Start accepts. Automaton has 9495 states and 33092 transitions. Word has length 78 [2021-07-13 18:35:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:23,144 INFO L482 AbstractCegarLoop]: Abstraction has 9495 states and 33092 transitions. [2021-07-13 18:35:23,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9495 states and 33092 transitions. [2021-07-13 18:35:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:35:23,172 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:23,172 INFO L508 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] [2021-07-13 18:35:23,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:35:23,173 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1412153015, now seen corresponding path program 1 times [2021-07-13 18:35:23,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:23,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701436450] [2021-07-13 18:35:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:23,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:23,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701436450] [2021-07-13 18:35:23,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701436450] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:23,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:23,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:35:23,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583267639] [2021-07-13 18:35:23,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:35:23,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:23,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:35:23,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:35:23,547 INFO L87 Difference]: Start difference. First operand 9495 states and 33092 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:23,978 INFO L93 Difference]: Finished difference Result 10119 states and 35040 transitions. [2021-07-13 18:35:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:35:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-07-13 18:35:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:24,022 INFO L225 Difference]: With dead ends: 10119 [2021-07-13 18:35:24,022 INFO L226 Difference]: Without dead ends: 9351 [2021-07-13 18:35:24,023 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 363.8ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:35:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9351 states. [2021-07-13 18:35:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9351 to 8919. [2021-07-13 18:35:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8919 states, 8918 states have (on average 3.4738730657098005) internal successors, (30980), 8918 states have internal predecessors, (30980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8919 states to 8919 states and 30980 transitions. [2021-07-13 18:35:24,312 INFO L78 Accepts]: Start accepts. Automaton has 8919 states and 30980 transitions. Word has length 80 [2021-07-13 18:35:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:24,312 INFO L482 AbstractCegarLoop]: Abstraction has 8919 states and 30980 transitions. [2021-07-13 18:35:24,312 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 8919 states and 30980 transitions. [2021-07-13 18:35:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:35:24,341 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:24,341 INFO L508 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] [2021-07-13 18:35:24,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:35:24,341 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1639207143, now seen corresponding path program 1 times [2021-07-13 18:35:24,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:24,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910810352] [2021-07-13 18:35:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:24,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:24,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910810352] [2021-07-13 18:35:24,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910810352] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:24,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:24,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:35:24,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090822963] [2021-07-13 18:35:24,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:35:24,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:35:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:35:24,609 INFO L87 Difference]: Start difference. First operand 8919 states and 30980 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:24,781 INFO L93 Difference]: Finished difference Result 13263 states and 45765 transitions. [2021-07-13 18:35:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-13 18:35:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-07-13 18:35:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:24,828 INFO L225 Difference]: With dead ends: 13263 [2021-07-13 18:35:24,828 INFO L226 Difference]: Without dead ends: 9819 [2021-07-13 18:35:24,829 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:35:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9819 states. [2021-07-13 18:35:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9819 to 8919. [2021-07-13 18:35:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8919 states, 8918 states have (on average 3.413321372505046) internal successors, (30440), 8918 states have internal predecessors, (30440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8919 states to 8919 states and 30440 transitions. [2021-07-13 18:35:25,212 INFO L78 Accepts]: Start accepts. Automaton has 8919 states and 30440 transitions. Word has length 80 [2021-07-13 18:35:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:25,213 INFO L482 AbstractCegarLoop]: Abstraction has 8919 states and 30440 transitions. [2021-07-13 18:35:25,213 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 8919 states and 30440 transitions. [2021-07-13 18:35:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:35:25,238 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:25,238 INFO L508 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] [2021-07-13 18:35:25,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:35:25,238 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1021280409, now seen corresponding path program 2 times [2021-07-13 18:35:25,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:25,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923000058] [2021-07-13 18:35:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:25,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:25,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923000058] [2021-07-13 18:35:25,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923000058] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:25,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:25,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:35:25,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337075146] [2021-07-13 18:35:25,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:35:25,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:25,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:35:25,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:35:25,354 INFO L87 Difference]: Start difference. First operand 8919 states and 30440 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:25,508 INFO L93 Difference]: Finished difference Result 10277 states and 34365 transitions. [2021-07-13 18:35:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:35:25,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-07-13 18:35:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:25,539 INFO L225 Difference]: With dead ends: 10277 [2021-07-13 18:35:25,539 INFO L226 Difference]: Without dead ends: 7317 [2021-07-13 18:35:25,539 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:35:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2021-07-13 18:35:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 7229. [2021-07-13 18:35:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7229 states, 7228 states have (on average 3.312672938572219) internal successors, (23944), 7228 states have internal predecessors, (23944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 23944 transitions. [2021-07-13 18:35:25,875 INFO L78 Accepts]: Start accepts. Automaton has 7229 states and 23944 transitions. Word has length 80 [2021-07-13 18:35:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:25,876 INFO L482 AbstractCegarLoop]: Abstraction has 7229 states and 23944 transitions. [2021-07-13 18:35:25,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7229 states and 23944 transitions. [2021-07-13 18:35:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-13 18:35:25,894 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:25,894 INFO L508 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-07-13 18:35:25,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:35:25,894 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2043748081, now seen corresponding path program 1 times [2021-07-13 18:35:25,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:25,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575075299] [2021-07-13 18:35:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:26,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:26,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575075299] [2021-07-13 18:35:26,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575075299] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:26,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:26,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:35:26,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140714199] [2021-07-13 18:35:26,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:35:26,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:35:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:35:26,031 INFO L87 Difference]: Start difference. First operand 7229 states and 23944 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-07-13 18:35:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:26,207 INFO L93 Difference]: Finished difference Result 6749 states and 21725 transitions. [2021-07-13 18:35:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:35:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-07-13 18:35:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:26,225 INFO L225 Difference]: With dead ends: 6749 [2021-07-13 18:35:26,225 INFO L226 Difference]: Without dead ends: 4709 [2021-07-13 18:35:26,226 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 111.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:35:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2021-07-13 18:35:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4709. [2021-07-13 18:35:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 4708 states have (on average 3.157604078164826) internal successors, (14866), 4708 states have internal predecessors, (14866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 14866 transitions. [2021-07-13 18:35:26,365 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 14866 transitions. Word has length 81 [2021-07-13 18:35:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:26,365 INFO L482 AbstractCegarLoop]: Abstraction has 4709 states and 14866 transitions. [2021-07-13 18:35:26,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-07-13 18:35:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 14866 transitions. [2021-07-13 18:35:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-13 18:35:26,377 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:26,377 INFO L508 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] [2021-07-13 18:35:26,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:35:26,378 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash -888262062, now seen corresponding path program 1 times [2021-07-13 18:35:26,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:26,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645419388] [2021-07-13 18:35:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:26,624 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:26,624 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645419388] [2021-07-13 18:35:26,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645419388] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:26,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:26,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:35:26,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892281756] [2021-07-13 18:35:26,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:35:26,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:26,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:35:26,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:35:26,625 INFO L87 Difference]: Start difference. First operand 4709 states and 14866 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:26,794 INFO L93 Difference]: Finished difference Result 3899 states and 12121 transitions. [2021-07-13 18:35:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:35:26,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-07-13 18:35:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:26,801 INFO L225 Difference]: With dead ends: 3899 [2021-07-13 18:35:26,801 INFO L226 Difference]: Without dead ends: 2303 [2021-07-13 18:35:26,801 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 120.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:35:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2021-07-13 18:35:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2303. [2021-07-13 18:35:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2302 states have (on average 2.9943527367506517) internal successors, (6893), 2302 states have internal predecessors, (6893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 6893 transitions. [2021-07-13 18:35:26,851 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 6893 transitions. Word has length 84 [2021-07-13 18:35:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:26,851 INFO L482 AbstractCegarLoop]: Abstraction has 2303 states and 6893 transitions. [2021-07-13 18:35:26,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 6893 transitions. [2021-07-13 18:35:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-13 18:35:26,856 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:26,857 INFO L508 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-07-13 18:35:26,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:35:26,857 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1107611328, now seen corresponding path program 1 times [2021-07-13 18:35:26,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:26,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333416689] [2021-07-13 18:35:26,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:35:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:35:27,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:35:27,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333416689] [2021-07-13 18:35:27,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333416689] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:35:27,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:35:27,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:35:27,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129237511] [2021-07-13 18:35:27,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:35:27,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:35:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:35:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:35:27,021 INFO L87 Difference]: Start difference. First operand 2303 states and 6893 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-07-13 18:35:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:35:27,226 INFO L93 Difference]: Finished difference Result 3461 states and 10447 transitions. [2021-07-13 18:35:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:35:27,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-07-13 18:35:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:35:27,230 INFO L225 Difference]: With dead ends: 3461 [2021-07-13 18:35:27,230 INFO L226 Difference]: Without dead ends: 1301 [2021-07-13 18:35:27,231 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 146.2ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:35:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2021-07-13 18:35:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1301. [2021-07-13 18:35:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1300 states have (on average 2.9023076923076925) internal successors, (3773), 1300 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-13 18:35:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 3773 transitions. [2021-07-13 18:35:27,257 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 3773 transitions. Word has length 89 [2021-07-13 18:35:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:35:27,257 INFO L482 AbstractCegarLoop]: Abstraction has 1301 states and 3773 transitions. [2021-07-13 18:35:27,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-07-13 18:35:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 3773 transitions. [2021-07-13 18:35:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-13 18:35:27,261 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:35:27,261 INFO L508 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-07-13 18:35:27,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:35:27,261 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:35:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:35:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1780619328, now seen corresponding path program 2 times [2021-07-13 18:35:27,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:35:27,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402800134] [2021-07-13 18:35:27,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:35:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:35:27,299 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:35:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:35:27,345 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:35:27,383 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 18:35:27,383 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 18:35:27,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:35:27,384 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-13 18:35:27,386 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:35:27,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:35:27 BasicIcfg [2021-07-13 18:35:27,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:35:27,500 INFO L168 Benchmark]: Toolchain (without parser) took 13210.47 ms. Allocated memory was 183.5 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 146.2 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 636.3 MB. Max. memory is 8.0 GB. [2021-07-13 18:35:27,500 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 183.5 MB. Free memory was 164.3 MB in the beginning and 164.2 MB in the end (delta: 139.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:35:27,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.07 ms. Allocated memory is still 183.5 MB. Free memory was 145.9 MB in the beginning and 153.2 MB in the end (delta: -7.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-07-13 18:35:27,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.38 ms. Allocated memory is still 183.5 MB. Free memory was 153.2 MB in the beginning and 150.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:35:27,501 INFO L168 Benchmark]: Boogie Preprocessor took 60.72 ms. Allocated memory is still 183.5 MB. Free memory was 150.0 MB in the beginning and 148.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:35:27,501 INFO L168 Benchmark]: RCFGBuilder took 1834.40 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 148.0 MB in the beginning and 152.0 MB in the end (delta: -4.0 MB). Peak memory consumption was 93.5 MB. Max. memory is 8.0 GB. [2021-07-13 18:35:27,501 INFO L168 Benchmark]: TraceAbstraction took 10616.38 ms. Allocated memory was 220.2 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 151.4 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 604.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:35:27,502 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 183.5 MB. Free memory was 164.3 MB in the beginning and 164.2 MB in the end (delta: 139.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 610.07 ms. Allocated memory is still 183.5 MB. Free memory was 145.9 MB in the beginning and 153.2 MB in the end (delta: -7.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 81.38 ms. Allocated memory is still 183.5 MB. Free memory was 153.2 MB in the beginning and 150.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.72 ms. Allocated memory is still 183.5 MB. Free memory was 150.0 MB in the beginning and 148.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1834.40 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 148.0 MB in the beginning and 152.0 MB in the end (delta: -4.0 MB). Peak memory consumption was 93.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10616.38 ms. Allocated memory was 220.2 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 151.4 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 604.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L725] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L726] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L727] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L728] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L729] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L735] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L736] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L737] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L738] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L739] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L741] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t301; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 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) [L755] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L755] 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) [L755] 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) [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 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 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 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 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L846] 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) [L846] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L846] 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) [L846] 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) [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 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 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L850] 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 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 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) [L857] 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) [L858] 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)) [L858] 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)) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10406.5ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 318.5ms, AutomataDifference: 3592.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 534.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1494 SDtfs, 2261 SDslu, 5735 SDs, 0 SdLazy, 706 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 749.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1768.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13387occurred in iteration=0, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3192.5ms AutomataMinimizationTime, 10 MinimizatonAttempts, 1420 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.6ms SsaConstructionTime, 637.1ms SatisfiabilityAnalysisTime, 1782.0ms InterpolantComputationTime, 885 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...