/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-14 00:17:09,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-14 00:17:09,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-14 00:17:09,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-14 00:17:09,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-14 00:17:09,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-14 00:17:09,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-14 00:17:09,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-14 00:17:09,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-14 00:17:09,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-14 00:17:09,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-14 00:17:09,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-14 00:17:09,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-14 00:17:09,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-14 00:17:09,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-14 00:17:09,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-14 00:17:09,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-14 00:17:09,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-14 00:17:09,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-14 00:17:09,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-14 00:17:09,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-14 00:17:09,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-14 00:17:09,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-14 00:17:09,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-14 00:17:09,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-14 00:17:09,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-14 00:17:09,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-14 00:17:09,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-14 00:17:09,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-14 00:17:09,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-14 00:17:09,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-14 00:17:09,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-14 00:17:09,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-14 00:17:09,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-14 00:17:09,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-14 00:17:09,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-14 00:17:09,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-14 00:17:09,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-14 00:17:09,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-14 00:17:09,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-14 00:17:09,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-14 00:17:09,105 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-Delay.epf [2021-07-14 00:17:09,125 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-14 00:17:09,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-14 00:17:09,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-14 00:17:09,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-14 00:17:09,127 INFO L138 SettingsManager]: * Use SBE=true [2021-07-14 00:17:09,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-14 00:17:09,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-14 00:17:09,129 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-14 00:17:09,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-14 00:17:09,129 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-14 00:17:09,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-14 00:17:09,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-14 00:17:09,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-14 00:17:09,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-14 00:17:09,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-14 00:17:09,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-14 00:17:09,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-14 00:17:09,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-14 00:17:09,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-14 00:17:09,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-14 00:17:09,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-14 00:17:09,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-14 00:17:09,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-14 00:17:09,131 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-14 00:17:09,131 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-14 00:17:09,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-14 00:17:09,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-14 00:17:09,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-14 00:17:09,497 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-14 00:17:09,498 INFO L275 PluginConnector]: CDTParser initialized [2021-07-14 00:17:09,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-07-14 00:17:09,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5263f0/6e57d2b1d9a149f09395a9e02d756d1d/FLAG9a303bdeb [2021-07-14 00:17:10,146 INFO L306 CDTParser]: Found 1 translation units. [2021-07-14 00:17:10,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-07-14 00:17:10,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5263f0/6e57d2b1d9a149f09395a9e02d756d1d/FLAG9a303bdeb [2021-07-14 00:17:10,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fb5263f0/6e57d2b1d9a149f09395a9e02d756d1d [2021-07-14 00:17:10,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-14 00:17:10,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-14 00:17:10,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-14 00:17:10,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-14 00:17:10,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-14 00:17:10,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:17:10" (1/1) ... [2021-07-14 00:17:10,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f95304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:10, skipping insertion in model container [2021-07-14 00:17:10,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:17:10" (1/1) ... [2021-07-14 00:17:10,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-14 00:17:10,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-14 00:17:10,774 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/safe010_pso.oepc.i[950,963] [2021-07-14 00:17:10,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:17:10,911 INFO L203 MainTranslator]: Completed pre-run [2021-07-14 00:17:10,921 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/safe010_pso.oepc.i[950,963] [2021-07-14 00:17:10,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-14 00:17:11,028 INFO L208 MainTranslator]: Completed translation [2021-07-14 00:17:11,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11 WrapperNode [2021-07-14 00:17:11,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-14 00:17:11,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-14 00:17:11,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-14 00:17:11,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-14 00:17:11,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-14 00:17:11,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-14 00:17:11,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-14 00:17:11,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-14 00:17:11,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (1/1) ... [2021-07-14 00:17:11,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-14 00:17:11,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-14 00:17:11,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-14 00:17:11,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-14 00:17:11,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (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-14 00:17:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-14 00:17:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-14 00:17:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-14 00:17:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-14 00:17:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-14 00:17:11,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-14 00:17:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-14 00:17:11,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-14 00:17:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-14 00:17:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-14 00:17:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-14 00:17:11,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-14 00:17:11,264 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-14 00:17:12,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-14 00:17:12,991 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-14 00:17:12,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:17:12 BoogieIcfgContainer [2021-07-14 00:17:12,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-14 00:17:12,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-14 00:17:12,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-14 00:17:12,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-14 00:17:12,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:17:10" (1/3) ... [2021-07-14 00:17:12,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c35087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:17:12, skipping insertion in model container [2021-07-14 00:17:12,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:17:11" (2/3) ... [2021-07-14 00:17:12,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c35087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:17:12, skipping insertion in model container [2021-07-14 00:17:12,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:17:12" (3/3) ... [2021-07-14 00:17:12,999 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2021-07-14 00:17:13,004 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-14 00:17:13,004 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-14 00:17:13,004 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-14 00:17:13,005 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-14 00:17:13,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,037 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,037 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-14 00:17:13,042 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-14 00:17:13,061 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-14 00:17:13,076 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-14 00:17:13,076 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-14 00:17:13,076 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-14 00:17:13,076 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-14 00:17:13,076 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-14 00:17:13,076 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-14 00:17:13,076 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-14 00:17:13,077 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-14 00:17:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 1251 states, 1093 states have (on average 1.8032936870997256) internal successors, (1971), 1250 states have internal predecessors, (1971), 0 states have call successors, (0), 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-14 00:17:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-07-14 00:17:13,618 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:13,619 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] [2021-07-14 00:17:13,619 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -580539508, now seen corresponding path program 1 times [2021-07-14 00:17:13,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:13,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650116988] [2021-07-14 00:17:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:14,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:14,039 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:14,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:14,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:14,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:14,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,085 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-14 00:17:14,085 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:14,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650116988] [2021-07-14 00:17:14,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650116988] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:14,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:14,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:17:14,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252111281] [2021-07-14 00:17:14,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:17:14,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:14,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:17:14,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:17:14,105 INFO L87 Difference]: Start difference. First operand has 1251 states, 1093 states have (on average 1.8032936870997256) internal successors, (1971), 1250 states have internal predecessors, (1971), 0 states have call successors, (0), 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 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-14 00:17:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:14,249 INFO L93 Difference]: Finished difference Result 1431 states and 2295 transitions. [2021-07-14 00:17:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:17:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-07-14 00:17:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:14,271 INFO L225 Difference]: With dead ends: 1431 [2021-07-14 00:17:14,272 INFO L226 Difference]: Without dead ends: 657 [2021-07-14 00:17:14,277 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 122.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:17:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2021-07-14 00:17:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2021-07-14 00:17:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 648 states have (on average 1.8842592592592593) internal successors, (1221), 656 states have internal predecessors, (1221), 0 states have call successors, (0), 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-14 00:17:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1221 transitions. [2021-07-14 00:17:14,358 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1221 transitions. Word has length 57 [2021-07-14 00:17:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:14,359 INFO L482 AbstractCegarLoop]: Abstraction has 657 states and 1221 transitions. [2021-07-14 00:17:14,359 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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-14 00:17:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1221 transitions. [2021-07-14 00:17:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-14 00:17:14,364 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:14,364 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] [2021-07-14 00:17:14,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-14 00:17:14,364 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -8266355, now seen corresponding path program 1 times [2021-07-14 00:17:14,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:14,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400989705] [2021-07-14 00:17:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:14,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:14,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:14,538 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:14,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:14,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:14,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:14,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,581 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-14 00:17:14,581 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:14,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400989705] [2021-07-14 00:17:14,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400989705] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:14,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:14,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:17:14,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124934399] [2021-07-14 00:17:14,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:17:14,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:14,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:17:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:17:14,584 INFO L87 Difference]: Start difference. First operand 657 states and 1221 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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-14 00:17:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:14,740 INFO L93 Difference]: Finished difference Result 837 states and 1602 transitions. [2021-07-14 00:17:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:17:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-07-14 00:17:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:14,743 INFO L225 Difference]: With dead ends: 837 [2021-07-14 00:17:14,743 INFO L226 Difference]: Without dead ends: 406 [2021-07-14 00:17:14,744 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 142.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-07-14 00:17:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-07-14 00:17:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2021-07-14 00:17:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.8927680798004987) internal successors, (759), 405 states have internal predecessors, (759), 0 states have call successors, (0), 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-14 00:17:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 759 transitions. [2021-07-14 00:17:14,763 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 759 transitions. Word has length 59 [2021-07-14 00:17:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:14,763 INFO L482 AbstractCegarLoop]: Abstraction has 406 states and 759 transitions. [2021-07-14 00:17:14,763 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 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-14 00:17:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 759 transitions. [2021-07-14 00:17:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-14 00:17:14,764 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:14,765 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] [2021-07-14 00:17:14,765 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-14 00:17:14,765 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1415038592, now seen corresponding path program 1 times [2021-07-14 00:17:14,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:14,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986806561] [2021-07-14 00:17:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:14,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:14,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:14,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:14,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:17:14,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:14,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:17:14,982 INFO L142 QuantifierPusher]: treesize reduction 26, result has 58.7 percent of original size [2021-07-14 00:17:14,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-14 00:17:15,014 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:15,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:15,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:15,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:15,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:15,074 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-14 00:17:15,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:15,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986806561] [2021-07-14 00:17:15,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986806561] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:15,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:15,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-14 00:17:15,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388959700] [2021-07-14 00:17:15,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-14 00:17:15,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-14 00:17:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-14 00:17:15,082 INFO L87 Difference]: Start difference. First operand 406 states and 759 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-14 00:17:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:15,324 INFO L93 Difference]: Finished difference Result 490 states and 950 transitions. [2021-07-14 00:17:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-14 00:17:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-07-14 00:17:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:15,329 INFO L225 Difference]: With dead ends: 490 [2021-07-14 00:17:15,329 INFO L226 Difference]: Without dead ends: 410 [2021-07-14 00:17:15,330 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 192.4ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-07-14 00:17:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-07-14 00:17:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-07-14 00:17:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 405 states have (on average 1.8888888888888888) internal successors, (765), 409 states have internal predecessors, (765), 0 states have call successors, (0), 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-14 00:17:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 765 transitions. [2021-07-14 00:17:15,345 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 765 transitions. Word has length 62 [2021-07-14 00:17:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:15,345 INFO L482 AbstractCegarLoop]: Abstraction has 410 states and 765 transitions. [2021-07-14 00:17:15,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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-14 00:17:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 765 transitions. [2021-07-14 00:17:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-14 00:17:15,347 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:15,347 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] [2021-07-14 00:17:15,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-14 00:17:15,347 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2011144508, now seen corresponding path program 2 times [2021-07-14 00:17:15,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:15,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070474016] [2021-07-14 00:17:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:15,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:15,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:15,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:15,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:17:15,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-14 00:17:15,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-14 00:17:15,574 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-07-14 00:17:15,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-14 00:17:15,602 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-07-14 00:17:15,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-14 00:17:15,631 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:15,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:15,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:15,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:15,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:15,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:15,682 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-14 00:17:15,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:15,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070474016] [2021-07-14 00:17:15,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070474016] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:15,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:15,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-14 00:17:15,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395097538] [2021-07-14 00:17:15,685 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-14 00:17:15,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-14 00:17:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-14 00:17:15,690 INFO L87 Difference]: Start difference. First operand 410 states and 765 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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-14 00:17:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,042 INFO L93 Difference]: Finished difference Result 484 states and 932 transitions. [2021-07-14 00:17:16,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-14 00:17:16,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-07-14 00:17:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,047 INFO L225 Difference]: With dead ends: 484 [2021-07-14 00:17:16,048 INFO L226 Difference]: Without dead ends: 404 [2021-07-14 00:17:16,048 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 314.7ms TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-07-14 00:17:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-07-14 00:17:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2021-07-14 00:17:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.8759493670886076) internal successors, (741), 399 states have internal predecessors, (741), 0 states have call successors, (0), 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-14 00:17:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 741 transitions. [2021-07-14 00:17:16,057 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 741 transitions. Word has length 62 [2021-07-14 00:17:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,058 INFO L482 AbstractCegarLoop]: Abstraction has 400 states and 741 transitions. [2021-07-14 00:17:16,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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-14 00:17:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 741 transitions. [2021-07-14 00:17:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-14 00:17:16,059 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,059 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] [2021-07-14 00:17:16,059 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-14 00:17:16,059 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1627661174, now seen corresponding path program 1 times [2021-07-14 00:17:16,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114603148] [2021-07-14 00:17:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:16,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,123 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:17:16,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:17:16,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:16,149 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:17:16,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,158 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-14 00:17:16,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:16,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114603148] [2021-07-14 00:17:16,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114603148] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:16,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:16,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-14 00:17:16,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489019779] [2021-07-14 00:17:16,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-14 00:17:16,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:16,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-14 00:17:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-14 00:17:16,160 INFO L87 Difference]: Start difference. First operand 400 states and 741 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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-14 00:17:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,246 INFO L93 Difference]: Finished difference Result 424 states and 731 transitions. [2021-07-14 00:17:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-14 00:17:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-07-14 00:17:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,249 INFO L225 Difference]: With dead ends: 424 [2021-07-14 00:17:16,249 INFO L226 Difference]: Without dead ends: 292 [2021-07-14 00:17:16,250 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-14 00:17:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-07-14 00:17:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-07-14 00:17:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.78397212543554) internal successors, (512), 291 states have internal predecessors, (512), 0 states have call successors, (0), 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-14 00:17:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 512 transitions. [2021-07-14 00:17:16,256 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 512 transitions. Word has length 63 [2021-07-14 00:17:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,256 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 512 transitions. [2021-07-14 00:17:16,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 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-14 00:17:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 512 transitions. [2021-07-14 00:17:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-07-14 00:17:16,257 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,258 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] [2021-07-14 00:17:16,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-14 00:17:16,258 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash 921571041, now seen corresponding path program 1 times [2021-07-14 00:17:16,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198823833] [2021-07-14 00:17:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:16,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,343 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-14 00:17:16,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-14 00:17:16,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:16,369 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-14 00:17:16,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,378 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-14 00:17:16,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:16,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198823833] [2021-07-14 00:17:16,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198823833] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:16,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:16,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-14 00:17:16,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202541245] [2021-07-14 00:17:16,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-14 00:17:16,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-14 00:17:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-14 00:17:16,380 INFO L87 Difference]: Start difference. First operand 292 states and 512 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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-14 00:17:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,495 INFO L93 Difference]: Finished difference Result 200 states and 292 transitions. [2021-07-14 00:17:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-14 00:17:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-07-14 00:17:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,497 INFO L225 Difference]: With dead ends: 200 [2021-07-14 00:17:16,497 INFO L226 Difference]: Without dead ends: 118 [2021-07-14 00:17:16,497 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 103.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:17:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-07-14 00:17:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-07-14 00:17:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 117 states have internal predecessors, (153), 0 states have call successors, (0), 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-14 00:17:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2021-07-14 00:17:16,500 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 64 [2021-07-14 00:17:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,500 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2021-07-14 00:17:16,501 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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-14 00:17:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2021-07-14 00:17:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-14 00:17:16,501 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,501 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] [2021-07-14 00:17:16,502 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-14 00:17:16,502 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash 45302228, now seen corresponding path program 1 times [2021-07-14 00:17:16,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,503 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959129885] [2021-07-14 00:17:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-14 00:17:16,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-14 00:17:16,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-14 00:17:16,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-14 00:17:16,602 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-07-14 00:17:16,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-14 00:17:16,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-14 00:17:16,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:16,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-14 00:17:16,663 INFO L142 QuantifierPusher]: treesize reduction 26, result has 57.4 percent of original size [2021-07-14 00:17:16,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-14 00:17:16,693 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-14 00:17:16,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-14 00:17:16,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-14 00:17:16,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-14 00:17:16,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-14 00:17:16,734 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-14 00:17:16,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-14 00:17:16,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959129885] [2021-07-14 00:17:16,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959129885] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-14 00:17:16,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-14 00:17:16,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-14 00:17:16,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028724703] [2021-07-14 00:17:16,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-14 00:17:16,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-14 00:17:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-14 00:17:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-07-14 00:17:16,736 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 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-14 00:17:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-14 00:17:16,948 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2021-07-14 00:17:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-14 00:17:16,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-07-14 00:17:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-14 00:17:16,950 INFO L225 Difference]: With dead ends: 159 [2021-07-14 00:17:16,950 INFO L226 Difference]: Without dead ends: 106 [2021-07-14 00:17:16,951 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-07-14 00:17:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-07-14 00:17:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-07-14 00:17:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 105 states have internal predecessors, (133), 0 states have call successors, (0), 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-14 00:17:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2021-07-14 00:17:16,954 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 67 [2021-07-14 00:17:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-14 00:17:16,954 INFO L482 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2021-07-14 00:17:16,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 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-14 00:17:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2021-07-14 00:17:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-14 00:17:16,955 INFO L500 BasicCegarLoop]: Found error trace [2021-07-14 00:17:16,955 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] [2021-07-14 00:17:16,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-14 00:17:16,955 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-14 00:17:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-14 00:17:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1009408842, now seen corresponding path program 2 times [2021-07-14 00:17:16,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-14 00:17:16,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495710581] [2021-07-14 00:17:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-14 00:17:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:17:17,002 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:17:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-14 00:17:17,067 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-14 00:17:17,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-14 00:17:17,098 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-14 00:17:17,098 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-14 00:17:17,099 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-14 00:17:17,101 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-14 00:17:17,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:17:17 BasicIcfg [2021-07-14 00:17:17,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-14 00:17:17,224 INFO L168 Benchmark]: Toolchain (without parser) took 6676.54 ms. Allocated memory was 127.9 MB in the beginning and 260.0 MB in the end (delta: 132.1 MB). Free memory was 90.0 MB in the beginning and 208.9 MB in the end (delta: -119.0 MB). Peak memory consumption was 116.4 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:17,225 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 127.9 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-14 00:17:17,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.28 ms. Allocated memory was 127.9 MB in the beginning and 179.3 MB in the end (delta: 51.4 MB). Free memory was 90.0 MB in the beginning and 149.4 MB in the end (delta: -59.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:17,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.82 ms. Allocated memory is still 179.3 MB. Free memory was 148.9 MB in the beginning and 146.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:17,227 INFO L168 Benchmark]: Boogie Preprocessor took 49.82 ms. Allocated memory is still 179.3 MB. Free memory was 146.3 MB in the beginning and 144.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:17,228 INFO L168 Benchmark]: RCFGBuilder took 1822.17 ms. Allocated memory is still 179.3 MB. Free memory was 144.2 MB in the beginning and 148.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 93.2 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:17,229 INFO L168 Benchmark]: TraceAbstraction took 4228.25 ms. Allocated memory was 179.3 MB in the beginning and 260.0 MB in the end (delta: 80.7 MB). Free memory was 148.1 MB in the beginning and 208.9 MB in the end (delta: -60.9 MB). Peak memory consumption was 123.2 MB. Max. memory is 8.0 GB. [2021-07-14 00:17:17,235 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.52 ms. Allocated memory is still 127.9 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 479.28 ms. Allocated memory was 127.9 MB in the beginning and 179.3 MB in the end (delta: 51.4 MB). Free memory was 90.0 MB in the beginning and 149.4 MB in the end (delta: -59.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 88.82 ms. Allocated memory is still 179.3 MB. Free memory was 148.9 MB in the beginning and 146.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 49.82 ms. Allocated memory is still 179.3 MB. Free memory was 146.3 MB in the beginning and 144.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1822.17 ms. Allocated memory is still 179.3 MB. Free memory was 144.2 MB in the beginning and 148.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 93.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4228.25 ms. Allocated memory was 179.3 MB in the beginning and 260.0 MB in the end (delta: 80.7 MB). Free memory was 148.1 MB in the beginning and 208.9 MB in the end (delta: -60.9 MB). Peak memory consumption was 123.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2582, positive: 2342, positive conditional: 2342, positive unconditional: 0, negative: 240, negative conditional: 240, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2509, positive: 2342, positive conditional: 0, positive unconditional: 2342, negative: 167, negative conditional: 0, negative unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 438, positive: 413, positive conditional: 0, positive unconditional: 413, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 438, positive: 412, positive conditional: 0, positive unconditional: 412, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 348, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 345, negative conditional: 0, negative unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2509, positive: 1929, positive conditional: 0, positive unconditional: 1929, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 438, unknown conditional: 0, unknown unconditional: 438] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 413, Positive conditional cache size: 0, Positive unconditional cache size: 413, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Independence queries for same thread: 73 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4025.0ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 37.5ms, AutomataDifference: 1376.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 512.4ms, PartialOrderReductionTime: 498.5ms, HoareTripleCheckerStatistics: 619 SDtfs, 817 SDslu, 2353 SDs, 0 SdLazy, 403 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 432.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1192.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1251occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 126.0ms AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.8ms SsaConstructionTime, 451.4ms SatisfiabilityAnalysisTime, 1162.5ms InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 2503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...